𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-edge connected spanning subgraphs and polyhedra

✍ Scribed by Ali Ridha Mahjoub

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
634 KB
Volume
64
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finding 2-edge connected spanning subgra
Finding 2-edge connected spanning subgraphs
✍ Woonghee Tim Huh πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 185 KB

This paper studies the NP-hard problem of ΓΏnding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G =(V; E) ΓΏnds a 2-ECSS of size at most |V |+(|E|-|V |)=(r -1). For r-regular, r-edge connected input graphs for r = 3, 4, 5 and

Spanning even subgraphs of 3-edge-connec
Spanning even subgraphs of 3-edge-connected graphs
✍ Bill Jackson; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract By Petersen's theorem, a bridgeless cubic graph has a 2‐factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3‐edge‐connec

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
✍ Cristina G Fernandes πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo