Improved Algorithms for Graph Four-Connectivity

We present a new algorithm based on ear decomposition for testing vertex four-connectivity and for finding all separating triplets in a triconnected graph. The sequential implementation of our algorithm runs in O(n2) time and the parallel implementation runs in O(logn) time using O(n2) processors on a CRCW PRAM, where n is the number of vertices in the graph. This improves previous bounds for the problem for both the sequential and parallel cases. The sequential algorithm is optimal if the input is specified in adjacency matrix form, or if the input graph is dense.

[1]  Zvi Galil,et al.  Finding the Vertex Connectivity of Graphs , 1980, SIAM J. Comput..

[2]  David W. Matula,et al.  Determining edge connectivity in 0(nm) , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Uzi Vishkin,et al.  Efficient Parallel Triconnectivity in Logarithmic Time , 1988, AWOC.

[4]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[5]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[6]  M. Sohoni,et al.  On Finding the Vertex Connectivity of Graphs. , 1987 .

[7]  László Lovász,et al.  A physical interpretation of graph connectivity, and its algorithmic applications , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  V. Ramachandran,et al.  A Characterization of Separating Pairs and Triplets in a Graph. , 1987 .

[9]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

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

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  Uzi Vishkin,et al.  Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs , 1986, Theor. Comput. Sci..

[14]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Kurt Mehlhorn,et al.  A Probabilistic Algorithm for Vertex Connectivity of Graphs , 1982, Inf. Process. Lett..

[16]  Shimon Even,et al.  Graph Algorithms , 1979 .

[17]  László Lovász,et al.  Computing ears and branchings in parallel , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Shimon Even,et al.  An Algorithm for Determining Whether the Connectivity of a Graph is at Least k , 1973, SIAM J. Comput..