The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
The Complexity of Parallel Evaluation of Linear Recurrences
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The VLSI Complexity of Selected Graph Problems
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Fast parallel algorithms for chordal graphs
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
Modified-Mesh Connected Parallel Computers
IEEE Transactions on Computers
New lower bounds for parallel computation
Journal of the ACM (JACM)
An EREW PRAM Algorithm for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A comparison of parallel algorithms for connected components
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Towards modeling the performance of a fast connected components algorithm on parallel machines
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
On Parallel Algorithms for Single-Fault Diagnosis in Fault Propagation Graph Systems
IEEE Transactions on Parallel and Distributed Systems
Finding connected components in O(log n loglog n) time on the EREW PRAM
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Principles of the parallel shape coding with the termination condition
CSC '91 Proceedings of the 19th annual conference on Computer Science
Efficient parallel algorithms for some graph problems
Communications of the ACM
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
Modified mesh-connected computers for image processing applications
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
Fast connected-component labeling
Pattern Recognition
An efficient first-scan method for label-equivalence-based labeling algorithms
Pattern Recognition Letters
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Fast PGAS connected components algorithms
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
CC-MR --- finding connected components in huge graphs with mapreduce
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
| Hi-index | 48.25 |
We present a parallel algorithm which uses n2 processors to find the connected components of an undirected graph with n vertices in time O(log2n). An O(log2n) time bound also can be achieved using only n⌈n/⌈log2n⌉⌉ processors. The algorithm can be used to find the transitive closure of a symmetric Boolean matrix. We assume that the processors have access to a common memory. Simultaneous access to the same location is permitted for fetch instructions but not for store instructions.