Browse > Article
http://dx.doi.org/10.7236/JIIBC.2014.14.1.51

Fast Determination of Minimum Spanning Tree Based on Down-sizing Technique of Edges Population  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Choi, Myeong-Bok (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.14, no.1, 2014 , pp. 51-59 More about this Journal
Abstract
This paper suggests a method of lessening number of a graph's edges population in order to rapidly obtain the minimum spanning tree. The present minimum spanning tree algorithm works on all the edges of the graph. However, the suggested algorithm reduces the edges population size by means of applying a method of deleting maximum weight edges in advance from vertices with more than 2 valencies. Next, it applies a stopping criterion which ideally terminates Borůvka, Prim, Kruskal and Reverse-Delete algorithms for reduced edges population. On applying the suggested algorithm to 9 graphs, it was able to minimize averagely 83% of the edges that do not become MST. In addition, comparing to the original graph, edges are turned out to be lessened 38% by Borůvka, 37% by Prim, 39% by Kruskal and 73% by Reverse-Delete algorithm, and thereby the minimum spanning tree is obtained promptly.
Keywords
Minimum Spanning Tree; Valency; Edges Population; Stopping Criteria;
Citations & Related Records
연도 인용수 순위
  • Reference
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.