Optimal enclosing regions in planar graphs
From MaRDI portal
Publication:3832585
DOI10.1002/net.3230190107zbMath0677.05019OpenAlexW2049637478MaRDI QIDQ3832585
Clyde l. Monma, Bienstock, Daniel
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190107
Related Items (6)
Shortest enclosing walks and cycles in embedded graphs ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ Two new criteria for finding Steiner hulls in Steiner tree problems ⋮ Geometric Knapsack problems ⋮ On the complexity of embedding planar graphs to minimize certain distance measures ⋮ Minimal connected enclosures on an embedded planar graph
Cites Work
This page was built for publication: Optimal enclosing regions in planar graphs
