Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/36899
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Fully dynamic maintenance of k-connectivity in parallel
Author: Liang, W.
Brent, R.
Shen, H.
Citation: IEEE Transactions on Parallel and Distributed Systems, 2001; 12(8):846-864
Publisher: IEEE Computer Soc
Issue Date: 2001
ISSN: 1045-9219
Statement of
Responsibility: 
Weifa Liang, Brent, R.P., Hong Shen
Abstract: Given a graph G=(V, E) with n vertices and m edges, the k-connectivity of G denotes either the k-edge connectivity or the k-vertex connectivity of G. In this paper, we deal with the fully dynamic maintenance of k-connectivity of G in the parallel setting for k=2, 3. We study the problem of maintaining k-edge/vertex connected components of a graph undergoing repeatedly dynamic updates, such as edge insertions and deletions, and answering the query of whether two vertices are included in the same k-edge/vertex connected component. Our major results are the following: (1) An NC algorithm for the 2-edge connectivity problem is proposed, which runs in O(log n log(m/n)) time using O(n3/4) processors per update and query. (2) It is shown that the biconnectivity problem can be solved in O(log2 n ) time using O(nα(2n, n)/logn) processors per update and O(1) time with a single processor per query or in O(log n logn/m) time using O(nα(2n, n)/log n) processors per update and O(logn) time using O(nα(2n, n)/logn) processors per query, where α(.,.) is the inverse of Ackermann's function. (3) An NC algorithm for the triconnectivity problem is also derived, which takes O(log n logn/m+logn log log n/α(3n, n)) time using O(nα(3n, n)/log n) processors per update and O(1) time with a single processor per query. (4) An NC algorithm for the 3-edge connectivity problem is obtained, which has the same time and processor complexities as the algorithm for the triconnectivity problem. To the best of our knowledge, the proposed algorithms are the first NC algorithms for the problems using O(n) processors in contrast to Ω(m) processors for solving them from scratch. In particular, the proposed NC algorithm for the 2-edge connectivity problem uses only O(n3/4) processors. All the proposed algorithms run on a CRCW PRAM
Description: ©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
RMID: 0020065652
DOI: 10.1109/71.946661
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_36899.pdf642.61 kBPublisher's PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.