Sciweavers

344 search results - page 4 / 69
» Banach-Mazur Games on Graphs
Sort
View
JCT
2008
101views more  JCT 2008»
13 years 7 months ago
Refined activation strategy for the marking game
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
Xuding Zhu
JAL
2002
99views more  JAL 2002»
13 years 7 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
LPAR
2010
Springer
13 years 5 months ago
The Complexity of Partial-Observation Parity Games
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...
Krishnendu Chatterjee, Laurent Doyen
CSL
2007
Springer
14 years 1 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
CSE
2009
IEEE
14 years 5 days ago
Gaming On and Off the Social Graph: The Social Structure of Facebook Games
—Games built on Online Social Networks (OSNs) have become a phenomenon since 3rd party developer tools were exposed by OSNs such as Facebook. However, apart from their explosive ...
Ben Kirman, Shaun Lawson, Conor Linehan