Parallel algorithms for connected components in a graph
- 3 August 2005
- book chapter
- Published by Springer Nature
- p. 208-217
- https://doi.org/10.1007/bfb0028804
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 1982
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Parallel algorithms for the connected components and minimal spanning tree problemsInformation Processing Letters, 1982
- Fast, Efficient Parallel Algorithms for Some Graph ProblemsSIAM Journal on Computing, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Parallel Computations in Graph TheorySIAM Journal on Computing, 1978
- Parallel algorithms for the transitive closure and the connected component problemsPublished by Association for Computing Machinery (ACM) ,1976
- Optimal algorithms for parallel polynomial evaluationJournal of Computer and System Sciences, 1973