Determining connected components in linear time by a linear number of processors
Author:
- 1 July 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (6) , 401-406
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphsInformation Processing Letters, 1986
- Efficient parallel algorithms for some graph problemsCommunications of the ACM, 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 Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- The Parallel Recognition of Classes of GraphsIEEE Transactions on Computers, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Cellular arrays for the solution of graph problemsCommunications of the ACM, 1972