Minimal connected enclosures on an embedded planar graph
type: Item
instance of: scholarly article
title: Minimal connected enclosures on an embedded planar graph
zbMATH Open document ID: 0924.68152
DOI: 10.1016/S0166-218X(98)00095-X
author: Christos Alexopoulos
author: J. Scott Provan
author: H. Donald Ratliff
author: Bryan R. Stutzman
published in: Discrete Applied Mathematics
publication date: 1999-03-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1271062
zbMATH Keywords: polynomial algorithms
MaRDI profile type: Publication
cites work: Q5535091
cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph
cites work: Optimal enclosing regions in planar graphs
cites work: Q3619797
cites work: The steiner problem in graphs
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Steiner's problem in graphs and its implications
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Shortest enclosing walks and cycles in embedded graphs
cites work: On finding two-connected subgraphs in planar graphs
cites work: The Steiner tree problem
Wikidata QID: Q126562854
description: scientific article; zbMATH DE number 1271062