1 |
J. Nesetril, E. Milkov'a, and H. Nesetrilov'a, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol. 233, 2001.
|
2 |
R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.
DOI
|
3 |
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
ScienceOn
|
4 |
Wikipedia, "Reverse-Delete Algorithm," http://en.wikipedia.org/wiki/Reverse_delete _algorithm, Wikimedia Foundation, Inc., 2007.
|
5 |
C. Peiper, CS 400 - Data Structures for Non CS-Majors," http://www.cs.uiuc.edu/class/fa05/cs400/_labs/ Lab12/suuri/, 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 |
Wikipedia, "Prim's Algorithm," http://en.wikipedia.org /wiki/Prims_algorithm, Wikimedia Foundation, Inc., 2007.
|
8 |
Yong-Jin Lee, Dong-Woo Lee, "Minimum Cost Spanning Tree Problem in Wireless Sensor Network and Heuristic Algorithm," Journal of Korean Institute of Information Technology, pp. 275-282, vol. 7, no. 4, 2009. 8.
|
9 |
M. B. Choi, S. U. Lee, "A Prim Minimum Spanning Tree Algorithm for Directed Graph," IIBC, v.12 no.3, 2012.
|
10 |
Dongyoung Shin, Joonseok Park, "A Performance Improvement for Tree Search using Dynamic Load Balancing between CPU and GPGPU," Journal of Korean Institute of Information Technology, vol. 10, no. 2, pp. 132-140, 2012. 2.
|
11 |
O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
|
12 |
Wikipedia, "Minimum Spanning Tree," http://en.wikipedi .org/wi k i /Mi n i mum_ spanning_tree, Wikimedia Foundation, Inc., 2007.
|