Monotony properties of connected visible graph searching

DOI10.1016/J.IC.2008.09.002MaRDI QIDQ999260zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Nicolas Nisse

Publication date 3 February 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.09.002

zbMATH Keywords

treewidthpathwidthgraph searching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Recommendations

• Monotony Properties of Connected Visible Graph Searching
• Connected graph searching
• Searching is not jumping.
• scientific article; zbMATH DE number 176249
• From pathwidth to connected pathwidth

Cites work

• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms and Computation
• An annotated bibliography on guaranteed graph searching
• Connected Treewidth and Connected Graph Searching
• Fugitive-search games on graphs and related parameters
• Graph minors. II. Algorithmic aspects of tree-width
• Graph searching and a min-max theorem for tree-width
• Mathematical Foundations of Computer Science 2005
• Monotonicity in graph searching
• Monotony Properties of Connected Visible Graph Searching
• Recontamination does not help to search a graph
• Searching and pebbling
• Searching is not jumping.
• The complexity of searching a graph
• The vertex separation and search number of a graph

Cited in

(12)

• Jumping robbers in digraphs
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
• Combinatorial trace method for network immunization
• Step-wise tile assembly with a constant number of tile types
• Monotony Properties of Connected Visible Graph Searching
• Connected search for a lazy robber
• Connected graph searching in chordal graphs
• The cost of monotonicity in distributed graph searching
• A connected version of the graph coloring game
• Connected graph searching
• Finding small-width connected path decompositions in polynomial time
• On the monotonicity of process number

This page was built for publication: Monotony properties of connected visible graph searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999260)