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

• Type: Journal
• Year: 2008
• Where: IANDC
• Authors: Pierre Fraigniaud, Nicolas Nisse
• Keywords: Classical Width Parameters, IANDC 2008, Invisible Search Number, Search Number