Lions and contamination, triangular grids, and Cheeger constants
From MaRDI portal
Publication:2080095
DOI10.1007/978-3-030-95519-9_8zbMath1498.05184arXiv2012.06702OpenAlexW3110741502MaRDI QIDQ2080095
Leah Gibson, Jack Pfaffinger, Henry Adams
Publication date: 7 October 2022
Full work available at URL: https://arxiv.org/abs/2012.06702
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
- An annotated bibliography on guaranteed graph searching
- Finite-time dynamic coverage for mobile sensor networks in unknown environments using neural networks
- How many lions are needed to clear a grid?
- Sweeping costs of planar domains
- Coverage in sensor networks via persistent homology
- Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
- “Lion and Man”: Upper and Lower Bounds
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Recontamination does not help to search a graph
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
- Solution of David Gale's lion and man problem
