Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68506OpenAlexW2494705596MaRDI QIDQ5492872

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Edge search number of cographs ⋮ Graph Searching in a Crime Wave ⋮ Monotonicity of Non-deterministic Graph Searching ⋮ Monotonicity of non-deterministic graph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ Distributed chasing of network intruders ⋮ Quiescence of self-stabilizing gossiping among mobile agents in graphs ⋮ Monotony properties of connected visible graph searching

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