19 search results - page 1 / 4 » The Complexity of Games on Highly Regular Graphs |
ESA
2005
Springer
13 years 10 months ago
2005
Springer
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...