Minimal connected enclosures on an embedded planar graph

DOI10.1016/S0166-218X(98)00095-XzbMath0924.68152WikidataQ126562854 ScholiaQ126562854MaRDI QIDQ1283782

Christos Alexopoulos, Bryan R. Stutzman, J. Scott Provan, H. Donald Ratliff

Publication date: 30 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithms

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On finding two-connected subgraphs in planar graphs

Cites Work

• Shortest enclosing walks and cycles in embedded graphs
• The Steiner tree problem
• On finding two-connected subgraphs in planar graphs
• On the Complexity of Covering Vertices by Faces in a Planar Graph
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Optimal enclosing regions in planar graphs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Steiner's problem in graphs and its implications
• The steiner problem in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal connected enclosures on an embedded planar graph