Translator Disclaimer
2009 Minimum spanning trees
Pallavi Jayawant, Kerry Glavin
Involve 2(4): 439-450 (2009). DOI: 10.2140/involve.2009.2.439

Abstract

The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired many others to look for alternate ways of finding a spanning tree of minimum weight in a weighted, connected graph since Borůvka’s time. This note presents a variant of Borůvka’s algorithm that developed during the graph theory course work of undergraduate students. We discuss the proof of the algorithm, compare it to existing algorithms, and present an implementation of the procedure in Maple.

Citation

Download Citation

Pallavi Jayawant. Kerry Glavin. "Minimum spanning trees." Involve 2 (4) 439 - 450, 2009. https://doi.org/10.2140/involve.2009.2.439

Information

Received: 1 March 2009; Accepted: 2 May 2009; Published: 2009
First available in Project Euclid: 20 December 2017

zbMATH: 1194.05147
MathSciNet: MR2579562
Digital Object Identifier: 10.2140/involve.2009.2.439

Subjects:
Primary: 05C85, 68R10

Rights: Copyright © 2009 Mathematical Sciences Publishers

JOURNAL ARTICLE
12 PAGES


SHARE
Vol.2 • No. 4 • 2009
MSP
Back to Top