Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem
A graph is said to be 2-edge-connected if it remains connected after the deletion of any single edge. Given an unweighted bridgeless graph G with n vertices, the minimum size 2-edge-connected spanning subgraph problem (2EC) is that of finding a 2-edge-connected spanning subgraph of G with the minimu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/24198 http://dx.doi.org/10.20381/ruor-3017 |