Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492872zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

treewidthpathwidthgraph searching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Nondeterministic graph searching: from pathwidth to treewidth
• Non-deterministic graph searching in trees
• scientific article; zbMATH DE number 176249
• Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
• Graph searching and a min-max theorem for tree-width

Cited in

(11)

• Non-deterministic graph searching in trees
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Edge search number of cographs
• An annotated bibliography on guaranteed graph searching
• Graph searching and a min-max theorem for tree-width
• Graph Searching in a Crime Wave
• Monotonicity of Non-deterministic Graph Searching
• Monotonicity of non-deterministic graph searching
• Monotony properties of connected visible graph searching
• Distributed chasing of network intruders
• Nondeterministic graph searching: from pathwidth to treewidth

This page was built for publication: Mathematical Foundations of Computer Science 2005

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