Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

DOI10.1007/978-3-540-73420-8_10zbMath1171.68588OpenAlexW2131926707MaRDI QIDQ5428800

André Berger, Michelangelo Grigni

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs

This page was built for publication: Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs