An Efficient Parallel Biconnectivity Algorithm
Open Access
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4), 862-874
- https://doi.org/10.1137/0214061
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Finding Euler tours in parallelJournal of Computer and System Sciences, 1984
- Parallel strong orientation of an undirected graphInformation Processing Letters, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Fast, Efficient Parallel Algorithms for Some Graph ProblemsSIAM Journal on Computing, 1981
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Finding Dominators in Directed GraphsSIAM Journal on Computing, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969