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

An Efficient Implementation of Kruskal's and Reverse-Delete Minimum Spanning Tree Algorithm  

Choi, Myeong-Bok (Dept. of Multimedia Engineering, Gangnung-Wonju National University)
Lee, Sang-Un (Dept. of Multimedia Engineering, Gangnung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.13, no.2, 2013 , pp. 103-114 More about this Journal
Abstract
This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.
Keywords
Minimum Spanning Tree; Cycle Property; Kruskal Algorithm; Reverse-Delete Algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 W. J. Wang, C. S. Han, "Bond Graph Modeling, Analysis and Control of Dual Stage System," Journal of the Korea Academia-Industrial cooperation Society, v.13, no.4, pp.1453-1459, April 2012.   과학기술학회마을   DOI   ScienceOn
2 M. B. Choi, S. U. Lee, "A Prim Minimum Spannin g Tree Algorithm for Directed Graph," IWIT, v.12 no.3, 2012.
3 Wikipedia, "Prim's Algorithm," http://en.wikipedi a.org/wiki/ Prims_algorithm, Wikimedia Foundation, Inc., 2010.
4 C. Peiper, CS 400 - Data Structures for Non CSMajors," http://www.cs.uiuc.edu/class/fa05/cs400 /_labs/Lab12/suuri/, 2005.
5 H. K. Park, C. H. Lee, "Embedded System Imple mentation of Tree Routing Structure for Ubiquitou s Sensor Network," Journal of the Korea Academi a-Industrial cooperation Society, v.11 no.10, pp.4531-4535, October 2011.
6 Wikipedia, "Minimum Spanning Tree," http://en.wi kipedia.org/ wiki/Minimum_spanning_tree, Wikim edia Foundation, Inc., 2007.
7 O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
8 J. Nesetril, E. Milkova, and H. Nesetrilova, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, Hist ory)," DMATH: Discrete Mathematics, Vol. 233, 2001.
9 R. C. Prim, "Shortest Connection Networks and So me Generalisations," Bell System Technical Journal, Vol. 36, pp. 1389-1401, 1957.   DOI
10 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
11 Wikipedia,"Reverse-Delete Algorithm," http://en.wikipedia.org/wiki/Reverse_delete_algorithm, Wiki media Foundation, Inc., 2007.
12 Wikipedia, "Graph (mathematics)," http://en.wikipe dia.org/wiki/ Graph_(mathematics), Wikimedia Foundation, Inc., 2010.
13 Wikipedia, "Glossary of Graph Theory," http://en.wikipedia.org/ wiki/Glossary_of_graph_theory, Wikimedia Foundation, Inc., 2010.
14 WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, http://www.maths.mq.edu.au/-wchen/lndmfolder/lndm.html, 2003.