2322 search results - page 148 / 465 » On a game in directed graphs |
190
click to vote
CAV
2003
Springer
15 years 12 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
136
click to vote
APAL
2008
15 years 6 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
207
click to vote
GAMESEC
2010
15 years 4 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
195
Voted
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
167
click to vote
BIRTHDAY
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...