Parallel Algorithms for Image Processing: Practical Algorithms with Experiments
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Work-Optimal Parallel Decoders for LZ2 Data Compression
DCC '00 Proceedings of the Conference on Data Compression
Incomparability in parallel computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We present a parallel randomized algorithm for finding the connected components of an undirected graph. Our algorithm takes T = O(log (n)) time and p = O(m+n/(log(n) processors, where m = number of edges and n = number of vertices. This algorithm improves the results of Cole and Vishkin1, which use O(log (n)ċlog (log (n))ċlog (log (log (n)))) time. Our algorithm is Optimal in the sense that the product PċT is a linear function of the input size. The algorithm requires O(m + n) space which is the input size, so it is Optimal in space as well.