Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem

Yu Sun
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 minimum number of edges. This problem has important applications in the design of survivable networks. However, because the problem is NP-hard, it is unlikely that efficient methods exist...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.