Graph Searching in a Crime Wave

DOI10.1007/978-3-540-74839-7_3zbMath1141.68548OpenAlexW1599467351MaRDI QIDQ3508551

Dimitrios M. Thilikos, David Richerby

Publication date: 1 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_3

Mathematics Subject Classification ID

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

Related Items (2)

An annotated bibliography on guaranteed graph searching ⋮ Searching for a Visible, Lazy Fugitive

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed searching and proper-path-width
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• Graph searching and a min-max theorem for tree-width
• The vertex separation and search number of a graph
• Fugitive-search games on graphs and related parameters
• Multiplicities of eigenvalues and tree-width of graphs
• Algorithms and obstructions for linear-width and related search parameters
• Monotonicity in graph searching
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Graph Searching in a Crime Wave