A counterexample to the algorithms for determining opaque minimal forests

DOI10.1016/S0020-0190(05)80008-0zbMath0751.68043OpenAlexW1975892719WikidataQ124959006 ScholiaQ124959006MaRDI QIDQ1183430

Thomas C. Shermer

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(05)80008-0

zbMATH Keywords

opaque minimal forest

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Improving the lower bound on opaque sets for equilateral triangle ⋮ Opaque sets ⋮ Opaque Sets ⋮ Computing Opaque Interior Barriers à la Shermer

Cites Work

• An algorithm for determining an opaque minimal forest of a convex polygon
• An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon

This page was built for publication: A counterexample to the algorithms for determining opaque minimal forests