Monotony properties of connected visible graph searching

13 years 4 months ago

Download www.liafa.jussieu.fr

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

Real-time Traffic

Classical Width Parameters | IANDC 2008 | Invisible Search Number | Search Number |

claim paper

» Weak Visibility of Two Objects in Planar Polygonal Scenes

» The Cost of Monotonicity in Distributed Graph Searching

» DESSIN Mining Dense Subgraph Patterns in a Single Graph

» Competitive Searching in a Generalized Street

» Graph Searching Elimination Trees and a Generalization of Bandwidth

» Hyperincident connected components of tagging networks

» Collaboration Improves the Connectivity of Wireless Networks

» Visibilitybased feature extraction from discrete models

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	IANDC
Authors	Pierre Fraigniaud, Nicolas Nisse

Comments (0)

Sciweavers

Monotony properties of connected visible graph searching

Classical Width Parameters | IANDC 2008 | Invisible Search Number | Search Number |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers