Monotony Properties of Connected Visible Graph Searching

DOI10.1007/11917496_21MaRDI QIDQ3522960zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Nicolas Nisse

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_21

zbMATH Keywords

graph searchingpathwidthtreewidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Games involving graphs (91A43)

Recommendations

• Monotony properties of connected visible graph searching
• Connected graph searching
• Searching is not jumping.
• Monotonicity and inert fugitive search games
• scientific article; zbMATH DE number 176249

Cited in

(7)

• Contraction obstructions for connected graph searching
• Monotonicity of Non-deterministic Graph Searching
• Connected graph searching
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
• Monotonicity of non-deterministic graph searching
• An annotated bibliography on guaranteed graph searching
• Monotony properties of connected visible graph searching

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 Q3522960)