Lions and contamination: monotone clearings

DOI10.1016/J.COMGEO.2022.101961MaRDI QIDQ2678261zbMATH OpenOpenAlexFDO

Authors Daniel Bertschinger, Meghana M. Reddy, Enrico Mann

Publication date 9 January 2023

Published in Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

algorithmic gamesclearingsgraph contaminationpursuit-evasion games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• How many lions are needed to clear a grid?
• Lions and contamination, triangular grids, and Cheeger constants
• Recontamination does not help to search a graph
• Searching is not jumping.
• Best laid plans of lions and men

Cites work

• An annotated bibliography on guaranteed graph searching
• Coordinate-free coverage in sensor networks with controlled boundaries via homology
• Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
• How many lions are needed to clear a grid?
• scientific article; zbMATH DE number 5507802 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 3204219 (Why is no real title available?)
• Lions and contamination, triangular grids, and Cheeger constants
• Recontamination does not help to search a graph

Cited in

(2)

• How many lions are needed to clear a grid?
• Lions and contamination, triangular grids, and Cheeger constants

This page was built for publication: Lions and contamination: monotone clearings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678261)