Sciweavers

344 search results - page 13 / 69
» Banach-Mazur Games on Graphs
Sort
View
ENDM
2006
119views more  ENDM 2006»
13 years 8 months ago
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
Stephan Dominique Andres
DAM
1999
90views more  DAM 1999»
13 years 8 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin
MFCS
2009
Springer
14 years 3 months ago
Stochastic Games with Finitary Objectives
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
Krishnendu Chatterjee, Thomas A. Henzinger, Floria...
MST
2011
207views Hardware» more  MST 2011»
13 years 3 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 6 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...