Abstract
We present randomized parallel algorithms for computing connected components of arbitrarily dense graphs on a mesh of processors or a Butterfly. Our algorithms are substantially faster than the ones in the literature for these models. We also present lower bounds on the time required by deterministic algorithms that match our (randomized) upper bounds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Awerbuch and Y. Shiloach, New connectivity and MSF algorithms for the shuffle-exchange network and PRAM, IEEE Transactions on Computers, C-36 (1987), pp. 1256–1263.
F.Y. Chin, J. Lam, and I. Chen, Efficient parallel algorithms for some graph problems, Communications of the ACM, 25 (1982), pp. 659–665.
K. Chong and T. Lam, Finding connected components in O(log n log log n) time on the EREW PRAM, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 11–20.
K. Chong and T. Lam, Finding connected components in O(log n log log n) time on the EREW PRAM, Journal of Algorithms, 18 (1995), pp. 378–402.
Gazit, An optimal randomized parallel algorithm for finding connected components in a graph,in Proceedings of the IEEE Annual Symposium on The Foundations of Computer Science, 1986, pp. 492–501.
H. Gazit, An optimal randomized parallel algorithm for finding connected components in a graph, SIAM Journal of Computing, 20 (1991), pp. 1046–1067.
S. Halperin and U. Zwick, An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 1–10.
S. Halperin and U. Zwick, An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM, Journal of Computer and System Sciences, 53 (1996), pp. 395–416.
D.S. Hirschberg, A.K. Chandra, and D.V. Sarwate, Computing connected components on parallel computers, Communications of the ACM, 22 (1979), pp. 461–464.
J. Ja’ja’, The VLSI Complexity of Selected Graph Problems, Journal of the ACM, 31 (1984), pp. 377–391.
D. Johnson and P. Metaxas, Connected components in o (log3/2 VI) parallel time for the crew pram, in Proceedings of the IEEE Annual Symposium on The Foundations of Computer Science, 1991, pp. 688–697.
D. Johnson and P. Metaxas, A parallel algorithm for computing minimum spanning trees, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 363–372.
D. Karger, N. Nisan, and M. Parnas, Fast connected component algorithms for the EREW PRAM, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 373–381.
F.T. Leighton, Introduction to parallel algorithms and architectures, Morgan-Kaufman, 1991.
L. Lovasz, Communication complexity: A survey, in Paths, Flows and VLSI Layout, Springer—Verlag, 1989.
D. Nassimi and S. Sahni, Finding Connected Components and Connected Ones on a Mesh Connected Computer, SIAM Journal of Computing, 9 (1980).
A.G. Ranade, How to emulate shared memory, Journal of Computer and System Sciences, 42 (1991), pp. 307–326. An earlier version appeared in the Proceedings of the Symposium on Foundations of Computer Science, 1987.
A.G. Ranade, Bandwidth Efficient Parallel Computation, in 23rd International Col- loquium On Automata, Languages And Programming (ICALP 96 ), 1996, pp. 4–23.
J.D. Ullman, Computational aspects of VLSI, Computer Science Press, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ranade, A. (1999). Locality in Computing Connected Components. In: Heath, M.T., Ranade, A., Schreiber, R.S. (eds) Algorithms for Parallel Processing. The IMA Volumes in Mathematics and its Applications, vol 105. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1516-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1516-5_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7175-8
Online ISBN: 978-1-4612-1516-5
eBook Packages: Springer Book Archive