356 search results - page 51 / 72 » Graph Games on Ordinals |
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
85
Voted
CAV
2003
Springer
15 years 2 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...
APAL
2008
14 years 9 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...
JCT
2007
14 years 9 months ago
2007
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...