Generating 3-vertex connected spanning subgraphs

In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K^2log(K)m^2+K^2m^3) time, where n and m are the number of vertices and edges of the input graph, respectively. This is an improvement over what was previously available and is the same as the best known running time for generating 2-vertex connected spanning subgraphs. Our result is obtained by applying the decomposition theory of 2-vertex connected graphs to the graphs obtained from minimal 3-vertex connected graphs by removing a single edge.

[1]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[2]  Vladimir Gurvich,et al.  Generating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs , 2006 .

[3]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[4]  Vladimir Gurvich,et al.  Enumerating Spanning and Connected Subsets in Graphs and Matroids , 2006, ESA.

[5]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[6]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[7]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[8]  Tomomi Matsui.  A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs , 1997, Algorithmica.

[9]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[10]  Tomomi Matsui.  An Algorithm for Finding All the Spanning Trees in Undirected Graphs , 1998 .

[11]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[12]  Vladimir Gurvich,et al.  Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs , 2005, ISAAC.

[13]  Vladimir Gurvich,et al.  Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems , 2004, IPCO.

[14]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[15]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[16]  Vladimir Gurvich,et al.  Generating Minimal k-Vertex Connected Spanning Subgraphs , 2007, COCOON.

[17]  Benno Schwikowski,et al.  On enumerating all minimal solutions of feedback problems , 2002, Discret. Appl. Math..

[18]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[19]  W. T. Tutte.  Connectivity in graphs , 1966 .