Parallel and Distributed Processing, IEEE Symposium on (1995)
San Antonio, Texas
Oct. 25, 1995 to Oct. 28, 1995
Weifa Liang , Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia
Hong Shen , Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia
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).
computational complexity; parallel algorithms; graph theory; data structures; maintaining 2-edge connectivity; edge insertions; deletions; O(log m) time; NC algorithm; parallel algorithm; 2-edge connectivity; dynamic data structures; graph problems
H. Shen and W. Liang, "Fully dynamic maintaining 2-edge connectivity in parallel," Parallel and Distributed Processing, IEEE Symposium on(SPDP), San Antonio, Texas, 1995, pp. 216.