Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
From MaRDI portal
Publication:5428800
Recommendations
- Algorithms – ESA 2005
- Minimum 2-edge connected spanning subgraph of certain graphs
- Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
- On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
- Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem
- Minimum-weight two-connected spanning networks
- 2-connected spanning subgraphs of planar 3-connected graphs
- On the minimum weight of a 3-connected 1-planar graph
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
Cited in
(9)- Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem
- scientific article; zbMATH DE number 742959 (Why is no real title available?)
- 2-connected spanning subgraphs of planar 3-connected graphs
- Algorithms – ESA 2005
- A PTAS for three-edge-connected survivable network design in planar graphs
- Minimum face-spanning subgraphs of plane graphs
- scientific article; zbMATH DE number 64356 (Why is no real title available?)
- Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
- Correlation clustering and two-edge-connected augmentation for planar graphs
This page was built for publication: Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428800)