Fault Tolerant Guarding of Grids

DOI10.1007/11751540_18MaRDI QIDQ5505335zbMATH OpenOpenAlexFDO

Authors Adrian Kosowski, Michal Malafiejski, Paweł Żyliński

Publication date 27 January 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751540_18

zbMATH Keywords

edge-colorable subgraphfault tolerant guardspacking factors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
• Cooperative mobile guards in grids
• Guarding galleries and terrains
• Guards, Galleries, Fortresses, and the Octoplex
• Inapproximability results for guarding polygons and terrains

Cited in

(2)

• Packing \([1, \Delta ]\)-factors in graphs of small degree
• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids

This page was built for publication: Fault Tolerant Guarding of Grids

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