Sciweavers

IANDC
2008
85views more  IANDC 2008»
13 years 4 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