Minimum 2-edge connected spanning subgraph of certain graphs

MaRDI QIDQ3452056zbMATH OpenFDO

Authors

Publication date 18 November 2015

zbMATH Keywords

Beneš networkbutterfly networkhoneycomb networkSierpiński gasket graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Finding 2-edge connected spanning subgraphs.
• scientific article; zbMATH DE number 1187147
• A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
• Two-edge connected spanning subgraphs and polyhedra
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph

Cited in

(9)

• Finding 2-edge connected spanning subgraphs.
• Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Minimal 2-connected graphs satisfying the even cut condition
• The minimum spanning subgraph problem with given cyclomatic number
• scientific article; zbMATH DE number 6119667 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

This page was built for publication: Minimum 2-edge connected spanning subgraph of certain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452056)