Lions and contamination: monotone clearings
From MaRDI portal
Publication:2678261
DOI10.1016/j.comgeo.2022.101961zbMath1506.05138OpenAlexW4308036976MaRDI QIDQ2678261
Meghana M. Reddy, Daniel Bertschinger, Enrico Mann
Publication date: 9 January 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101961
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- An annotated bibliography on guaranteed graph searching
- How many lions are needed to clear a grid?
- Lions and contamination, triangular grids, and Cheeger constants
- Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
- Recontamination does not help to search a graph
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lions and contamination: monotone clearings