Fully dynamic maintaining 2-edge connectivity in parallel

This paper studies the problem of maintaining the 2-edge-connected components of a graph undergoing repeatedly dynamic updates such as edge insertions and deletions. It is shown that all operations such as inserting an edge to or deleting an edge from the graph, and answering the query about whether two vertices belong to the same 2-edge connected component can be completed in O(log m) time with O(m/sup 3/4/) processors or in O(log n log(m/n)) time with O(n/sup 3/4/) processors on a priority CRCW PRAM, where m is the current number of edges and n is the number of vertices. To our knowledge, the proposed algorithm is the first NC algorithm for this problem using sublinear number processors o(m).

[1]  Zvi Galil,et al.  Improved Sparsification , 1993 .

[2]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Baruch Awerbuch,et al.  New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.

[5]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[6]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[7]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[9]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[11]  Zvi Galil,et al.  Fully Dynamic Algorithms for 2-Edge Connectivity , 1992, SIAM J. Comput..

[12]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[13]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[14]  Paolo Ferragina.  An EREW PRAM fully-dynamic algorithm for MST , 1995, Proceedings of 9th International Parallel Processing Symposium.

[15]  Sajal K. Das,et al.  An o(n) Work EREW Parallel Algorithm for Updating MST , 1994, ESA.