Bounds for cops and robber pursuit
From MaRDI portal
Publication:991186
DOI10.1016/J.COMGEO.2010.02.002zbMATH Open1209.05152OpenAlexW2080730209MaRDI QIDQ991186FDOQ991186
Authors: L. Alonso, Edward M. Reingold 
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
Recommendations
- Improved bounds for cops-and-robber pursuit
- Cops and robber with constraints
- Cops, robber and traps
- Cops and robbers from a distance
- Limited visibility cops and robber
- A bound for the cops and robbers problem
- scientific article; zbMATH DE number 6180528
- scientific article; zbMATH DE number 1792626
- Simultaneously moving cops and robbers
- Ambush cops and robbers
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex-to-vertex pursuit in a graph
- Title not available (Why is that?)
- A game of cops and robbers
- Chases and escapes. The mathematics of pursuit and evasion
- Compressions and isoperimetric inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized Pursuit-Evasion with Local Visibility
- The complexity of pursuit on a graph
- Title not available (Why is that?)
- “Lion and Man”: Upper and Lower Bounds
- Solution of David Gale's lion and man problem
- Title not available (Why is that?)
- Lion and Man: The Boundary Constraint
- Title not available (Why is that?)
- Lion and Man: The General Case
- 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
- “Lion and Man”: A Postscript
- The lion and man problem - revisited
- The Robot and the Rabbit--A Pursuit Problem
- Some Results on Max-Min Pursuit
Cited In (1)
This page was built for publication: Bounds for cops and robber pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991186)
