Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference17 articles.
1. Sur le couplage maximum d'un graphe;Berge;C. R. Acad. Sci. Paris,1958
2. An efficient algorithm for guard placement in polygons with holes;Bjorling-Sachs;Discrete Comput. Geom.,1995
3. N. Blum, A new approach to maximum matching in general graphs, in: Proc. 17th ICALP (Warwick, 1990), Lecture Notes in Comput. Sci., Vol. 443, Springer, Berlin, pp. 586–597
4. Matching and spanning in certain planar graphs;Carlyle;Math. Systems Theory,1983
5. Guarding rectangular art galleries;Czyzowicz;Discrete Math.,1994
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The searchlight problem for road networks;Theoretical Computer Science;2015-08
2. Watchman routes for lines and line segments;Computational Geometry;2014-05
3. THE MINIMUM GUARDING TREE PROBLEM;Discrete Mathematics, Algorithms and Applications;2014-02-18
4. Disjoint Compatible Geometric Matchings;Discrete & Computational Geometry;2012-10-03
5. Watchman Routes for Lines and Segments;Algorithm Theory – SWAT 2012;2012