Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492872
DOI10.1007/11549345zbMATH Open1156.68506OpenAlexW2494705596MaRDI QIDQ5492872FDOQ5492872
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
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)
