Bounds for cops and robber pursuit

DOI10.1016/J.COMGEO.2010.02.002zbMath1209.05152OpenAlexW2080730209MaRDI QIDQ991186

Edward M. Reingold, Laurent Alonso

Publication date: 2 September 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.02.002

zbMATH Keywords

cops and robberpursuitevasionlion and manrabbit and robottractrix

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Improved bounds for cops-and-robber pursuit

Cites Work

• The complexity of pursuit on a graph
• A game of cops and robbers
• Compressions and isoperimetric inequalities
• Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
• Escaping offline searchers and isoperimetric theorems
• The lion and man problem - revisited
• Vertex-to-vertex pursuit in a graph
• “Lion and Man”: Upper and Lower Bounds
• “Lion and Man”: A Postscript
• Randomized Pursuit-Evasion with Local Visibility
• The Robot and the Rabbit--A Pursuit Problem
• Some Results on Max-Min Pursuit
• Lion and Man: The General Case
• Lion and Man: The Boundary Constraint
• Solution of David Gale's lion and man problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for cops and robber pursuit