(algorithm)
Definition: Compute a minimum spanning tree.
See also Kruskal's algorithm, Prim-Jarnik algorithm.
Author: PEB
Eppstein's lecture outlining and contrasting MST algorithms.
O. Boruvka, O jistem problemu minimalnim, Praca Moravske Prirodovedecke Spolecnosti, 3:37-58, 1926. (in Czech) (The u in Boruvka has a small o above it.)
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2006.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "Boruvka's algorithm", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/boruvkasAlgorithm.html
