1 |
Wikipedia, "Minimum Spanning Tree," http://en.wikipedia.org/wiki/Minimum_spanning_tree, Wikimedia Foundation, Inc., 2007.
|
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 |
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.
|
4 |
R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.
DOI
|
5 |
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.
|
6 |
Wikipedia, "Reverse-Delete Algorithm," http://en.wikipedia.org/wiki/Reverse_delete_algorithm, Wikimedia Foundation, Inc., 2007.
|
7 |
Wikipedia,"Graph(mathematics)," http://en.wikipedia. org/wiki/Graph_(mathematics), Wikimedia Foundation, Inc., 2007.
|
8 |
M. B. Choi, S. U. Lee, "A Prim Minimum Spanning Tree Algorithm for Directed Graph," IWIT, v.12 no.3, 2012.
|
9 |
Yong-Jin Lee, Dong-Woo Lee, "Minimum Cost Spanning Tree Problem in Wireless Sensor Network and Heuristic Algorithm," Journal of Advanced Information Technology and Convergence, pp. 275-282, vol. 7, no. 4, 2009. 8.
|