Problem Definition
Given a weighted undirected graph G with n vertices and m edges, compute a minimum spanning tree (or spanning forest) of G on a parallel random access machine (PRAM) without concurrent write capability.
A minimum spanning tree of a graph is a spanning tree with the smallest possible sum of edge weights. The parallel random access machine (PRAM) is an abstract model for designing parallel algorithms and understanding the power of parallelism. In this model, processors (each being a random access machine) work in a synchronous manner and communicate through a shared memory. PARM can be further classified according to whether it is allowed for more than one processor to read and write into the same shared memory location simultaneously. The strongest model is CRCW (concurrent-read, concurrent-write) PRAM, and the weakest is EREW (exclusive-read, exclusive-write) PRAM. For an introduction to PRAM algorithms, one can refer to Karp and Ramachandran [8] and JáJá [5].
The...
This is a preview of subscription content, log in via an institution.
Recommended Reading
Chong KW, Han Y, Lam TW (2001) Concurrent threads and optical parallel minimum spanning trees algorithm. J ACM 48(2):297–323
Cole R, Klein PN, Tarjan RE (1996) Finding minimum spanning forests in logarithmic time and linear work using random sampling. In: Proceedings of the 8th annual ACM symposium on parallel architectures and algorithms, Padua, pp 243–250
Cole R, Vishkin U (1986) Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In: Proceedings of the 27th annual IEEE symposium on foundations of computer science, Toronto, pp 478–491
Cook SA, Dwork C, Reischuk R (1986) Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J Comput 15(1):87–97
JáJá J (1992) An introduction to parallel algorithms. Addison-Wesley, Boston
Johnson DB, Metaxas P (1991) Connected components in O(lg\(^{3/2}\,\vert \,V \,\vert \,\)) parallel time for the CREW PRAM. In: Proceedings of the 32nd annual IEEE symposium on foundations of computer science, San Juan, pp 688–697
Karger DR (1995) Random sampling in graph optimization problems. Ph.D. thesis, Department of computer science, Stanford University
Karp RM, Ramachandran V (1990) Parallel algorithms for shared-memory machines. In: Van Leeuwen Ed J (ed) Handbook of theoretical computer science, vol A, pp 869–941. MIT Press, Massachusetts
Pettie S, Ramachandran V (2002) An optimal minimum spanning tree algorithm. J ACM 49(1):16–34
Pettie S, Ramachandran V (2002) A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J Comput 31(6):1879–1895
Poon CK, Ramachandran V (2003) A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest. Algorithmica 35(3):257–268
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Lam, TW. (2015). Parallel Connectivity and Minimum Spanning Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_280-2
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_280-2
Received:
Accepted:
Published:
Publisher Name: Springer, Boston, MA
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering