Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs
SIAM Journal on Computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Reducing edge connectivity to vertex connectivity
ACM SIGACT News
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On-line maintenance of the four-components of a graph (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Fully dynamic algorithms for 2-edge connectivity
SIAM Journal on Computing
Finding triconnected components by local replacement
SIAM Journal on Computing
Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity
SIAM Journal on Computing
Maintenance of 2- and 3-edge-connected components of graphs I
Discrete Mathematics - Special issue on combinatorics and algorithms
Static and dynamic parallel computation of connected components
Information Processing Letters
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A faster parallel algorithm for k-connectivity
Information Processing Letters
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Efficient parallel algorithms for some graph problems
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An EREW PRAM fully-dynamic algorithm for MST
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Maintenance of Triconnected Components of Graphs (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
An o(n) Work EREW Parallel Algorithm for Updating MST
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully dynamic maintaining 2-edge connectivity in parallel
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Dependency-aware maintenance for highly available service-oriented grid
Journal of Systems and Software
Mining most frequently changing component in evolving graphs
World Wide Web
Hi-index | 0.00 |
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(n^{3/4})$ processors per update and query. 2) It is shown that the biconnectivity problem can be solved in $O(\log^2 n)$ time using $O(n\alpha(2n,n)/\log n)$ processors per update and $O(1)$ time with a single processor per query or in $O(\log n \log{m \over n})$ time using $O(n\alpha(2n,n)/\log n)$ processors per update and $O(\log n)$ time using $O(n \alpha(2n,n)/\log n)$ processors per query, where $\alpha(.,.)$ is the inverse of Ackermann's function. 3) An NC algorithm for the triconnectivity problem is also derived, which takes $O(\log n \log{m \over n}+\log n \log\log n /\alpha(3n,n))$ time using $O(n\alpha(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 $\Omega(m)$ processors for solving them from scratch. In particular, the proposed NC algorithm for the 2-edge connectivity problem uses only $O(n^{3/4})$ processors. All the proposed algorithms run on a CRCW PRAM.