On finding two-connected subgraphs in planar graphs

DOI10.1016/S0167-6377(96)00046-6zbMath0890.90176OpenAlexW2020904545WikidataQ127095584 ScholiaQ127095584MaRDI QIDQ1376267

J. Scott Provan

Publication date: 17 December 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00046-6

zbMATH Keywords

polynomial-time algorithmplanar graphSteiner treenetwork survivabilitydesign of reliable networksminimum-weight 2-connected subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Minimal connected enclosures on an embedded planar graph

Cites Work

• Minimum-weight two-connected spanning networks
• Shortest enclosing walks and cycles in embedded graphs
• The Steiner tree problem
• Minimal connected enclosures on an embedded planar graph
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Generalized steiner problem in series-parallel networks
• Convexity and the Steiner tree problem
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Biconnectivity approximations and graph carvings

This page was built for publication: On finding two-connected subgraphs in planar graphs