1 |
Wikipedia, http://en.wikipedia.org/wiki/Minimum_spanning_ tree
|
2 |
O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No.3, pp.37-58, 1926.
|
3 |
R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol.36, pp.1389-1401, 1957.
DOI
|
4 |
J. B. Kruskal, "On the Shortest Spanning Subtree and The Traveling Salesman Problem," Proceedings of the American Mathematical Society, Vol.7, pp.48-50, 1956.
DOI
|
5 |
J. Erickson, "CS 473G -Graduate Algorithms," Dept. of Computer Science, University of Illinois, 2005.
|
6 |
WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, http://www. maths.mq.edu.au/~wchen/lndmfolder/ lndm.html, 2003.
|
7 |
C. Peiper, CS 400 -Data Structures for Non CS-Majors, http://www.cs.uiuc.edu/class/fa05/cs400/_labs/Lab12/suuri/, 2005.
|
8 |
Wikipedia, http://en.wikipedia.org/wiki/Kruskal_algorithm
|
9 |
J. Neeetril, E. Milkova, and H. Nesetrilova, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol.233, 2001.
|