Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
Optimal parallel algorithms on planar graphs
Information and Computation
Information and Computation
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An optimal randomized parallel algorithm for finding connected components in a graph
SIAM Journal on Computing
Connected components in O(lg3/2|V|) parallel time for the CREW PRAM (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A simpler parallel algorithm for graph connectivity
Journal of Algorithms
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Improving a long chain of works we obtain a randomized EREW PRAM algorithm for finding the connected components of a graph G=(V,E) with n vertices and m edges in O(log n) time using an optimal number of O((m+n)/log n) processors. The result returned by the algorithm is always correct. The probability that the algorithm will not complete in O(log n) time is at most n-c for any desired c 0.The best deterministic EREW PRAM connectivity algorithm, obtained by Chong and Lam, runs in O(log n log log n) time using m + n processors.