How many lions are needed to clear a grid?
DOI10.3390/A2031069zbMATH Open1461.91049OpenAlexW2082754619MaRDI QIDQ1662492FDOQ1662492
Authors: Florian Berger, Alexander Gilbers, Ansgar Grüne, Rolf Klein 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a2031069
Recommendations
isoperimetric inequalitygraph searchpursuit gameslion and manavoidance numbersafe path planninggraph separator
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Vertex-to-vertex pursuit in a graph
- A Separator Theorem for Planar Graphs
- Title not available (Why is that?)
- Compressions and isoperimetric inequalities
- Recontamination does not help to search a graph
- “Lion and Man”: Upper and Lower Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Cited In (9)
- On a Fire Fighter’s Problem
- Searching for an intruder on graphs and their subdivisions
- A local strategy for cleaning expanding cellular domains by simple robots
- Geometric firefighting in the half-plane
- Improved bounds for cops-and-robber pursuit
- Lions and contamination: monotone clearings
- Non-adaptive and adaptive two-sided search with fast objects
- Reversibility properties of the fire-fighting problem in graphs
- Lions and contamination, triangular grids, and Cheeger constants
Uses Software
This page was built for publication: How many lions are needed to clear a grid?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662492)
