Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces

@article{Bose2003WorstcaseoptimalAF,
  title={Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces},
  author={Prosenjit Bose and David G. Kirkpatrick and Zaiqing Li},
  journal={Comput. Geom.},
  year={2003},
  volume={26},
  pages={209-219}
}
We present an optimal (n)-time algorithm for the selection of a subset of the vertices of an nvertex plane graph G so that each of the faces of G is covered by (i.e. incident with) one or more of the selected vertices. At most bn=2 vertices are selected, matching the worst-case requirement. Analogous results for edge-covers are developed for two different… CONTINUE READING