Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
DOI10.1016/S0925-7721(03)00027-0zbMath1022.05078OpenAlexW2061541114MaRDI QIDQ1410592
Zaiqing Li, David G. Kirkpatrick, Prosenjit Bose
Publication date: 14 October 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(03)00027-0
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
Cites Work
- Guarding polyhedral terrains
- Edge guarding polyhedral terrains
- A short proof of Chvatal's Watchman Theorem
- Every planar map is four colorable. I: Discharging
- The four-colour theorem
- A combinatorial theorem in plane geometry
- Efficient Algorithms for Petersen's Matching Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces