Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Borůvka O (1926) O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti 3:37–58. (In Czech)
Buchsbaum A, Kaplan H, Rogers A, Westbrook JR (1998) Linear-time pointer-machine algorithms for least common ancestors, MST verification and dominators. In: Proceedings of the ACM symposium on theory of computing (STOC), Dallas, pp 279–288
Chan TM (1998) Backward analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees. Inf Process Lett 67:303–304
Chazelle B (2000) A minimum spanning tree algorithm with inverse-Ackermann type complexity. J ACM 47(6):1028–1047
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT, Cambridge
Dixon B, Rauch M, Tarjan RE (1992) Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J Comput 21(6):1184–1192
Gabow HN, Galil Z, Spencer TH, Tarjan RE (1986) Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6:109–122
Graham RL, Hell P (1985) On the history of the minimum spanning tree problem. Ann Hist Comput 7(1):43–57
Karger DR, Klein PN, Tarjan RE (1995) A randomized linear-time algorithm for finding minimum spanning trees. J ACM 42(2):321–329
Karp RM, Ramachandran V (1990) Parallel algorithms for shared-memory machines. In: van Leeuwen J (ed) Handbook of theoretical computer science. Elsevier Science, Amsterdam, pp 869–941
Katriel I, Sanders P, Träff JL (2003) A practical minimum spanning tree algorithm using the cycle property. In: Proceedings of the 11th annual European symposium on algorithms, Budapest. LNCS, vol 2832. Springer, Berlin, pp 679–690
King V (1997) A simpler minimum spanning tree verification algorithm. Algorithmica 18(2):263–270
Komlós J (1985) Linear verification for spanning trees. Combinatorica 5(1):57–65
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
Pettie S, Ramachandran V (2002) Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. In: Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA), San Francisco, pp 713–722
Pettie S, Ramachandran V (2008) New randomized minimum spanning tree algorithms using exponentially fewer random bits. ACM Trans Algorithms 4(1):article 5
Acknowledgements
This work was supported in part by NSF grant CFF-0514876.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Ramachandran, V. (2016). Randomized Minimum Spanning Tree. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_325
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_325
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering