Cooperative mobile guards in grids

DOI10.1016/J.COMGEO.2006.11.002MaRDI QIDQ876501zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

mobile guardscooperative guardsquadratic time algorithmsimple grids

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
• Cooperative guards in art galleries
• Cooperative guards in art galleries with one hole
• scientific article; zbMATH DE number 969102
• Mobile versus point guards

Cites work

• scientific article; zbMATH DE number 1728322 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• Art gallery theorems for guarded guards.
• Covering grids and orthogonal polygons with periscope guards
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• On gallery watchmen in grids
• Orthogonal segment stabbing
• Planar 3DM is NP-complete
• Steiner trees, connected domination and strongly chordal graphs
• Watched guards in art galleries

Cited in

(10)

• Global defensive sets in graphs
• scientific article; zbMATH DE number 2148113 (Why is no real title available?)
• 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
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Fault Tolerant Guarding of Grids
• 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)