Sciweavers

344 search results - page 45 / 69
» Banach-Mazur Games on Graphs
Sort
View
IANDC
2008
85views more  IANDC 2008»
13 years 8 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse
DM
2010
140views more  DM 2010»
13 years 8 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
AAAI
2006
13 years 10 months ago
A Polynomial-Time Algorithm for Action Graph Games
Albert Xin Jiang, Kevin Leyton-Brown
DM
2010
65views more  DM 2010»
13 years 8 months ago
Decomposition of sparse graphs, with application to game coloring number
Mickaël Montassier, Arnaud Pêcher, Andr...