Cooperative mobile guards in grids
From MaRDI portal
Publication:876501
DOI10.1016/J.COMGEO.2006.11.002zbMATH Open1121.65021OpenAlexW2095509593MaRDI QIDQ876501FDOQ876501
Authors: Adrian Kosowski, Michal Malafiejski, Paweł Żyliński 
Publication date: 18 April 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.11.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Art gallery theorems for guarded guards.
- Planar 3DM is NP-complete
- Title not available (Why is that?)
- A combinatorial theorem in plane geometry
- Steiner trees, connected domination and strongly chordal graphs
- Title not available (Why is that?)
- Orthogonal segment stabbing
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- On gallery watchmen in grids
- Watched guards in art galleries
- Title not available (Why is that?)
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
- Covering grids and orthogonal polygons with periscope guards
- An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
Cited In (10)
- Global defensive sets in graphs
- Title not available (Why is that?)
- The searchlight problem for road networks
- THE MINIMUM GUARDING TREE PROBLEM
- An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
- Watchman routes for lines and line segments
- Algorithms and Complexity of Alliances in Graphs
- Fault Tolerant Guarding of Grids
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Mobile versus point guards
This page was built for publication: Cooperative mobile guards in grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876501)
