scientific article; zbMATH DE number 140478
From MaRDI portal
Publication:4028896
edge coverline segmentspolynomial time algorithmdual graphilluminationmaximum matchingvisibility graphsgalleriesconvex partition of the planelight matchings
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Recommendations
Cited in
(7)- Illuminating disjoint line segments in the plane
- Illuminating labyrinths.
- Obituary: Ivan Rival
- scientific article; zbMATH DE number 1786530 (Why is no real title available?)
- Illumination in the presence of opaque line segments in the plane
- Guarding disjoint triangles and claws in the plane
- Illuminating a network from its nodes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028896)