356 search results - page 35 / 72 » Graph Games on Ordinals |
JUCS
2007
14 years 9 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
CG
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
101
click to vote
CPC
2010
14 years 7 months ago
2010
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...