Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.7.131

An Efficient Implementation of Kruskal's Algorithm for A Minimum Spanning Tree  

Lee, Ju-Young (School of Information and Media, Duksung Women's University)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.7, 2014 , pp. 131-140 More about this Journal
Abstract
In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.
Keywords
minimum spanning tree; weighted graph; cycle; Kruskal's algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, vol. 36, pp. 1389-1401, Nov. 1957.   DOI
2 Wikipedia, "Minimum Spanning Tree," http://en.wikipedia.org/wiki/Minimum_spanning_tree, Wikimedia Foundation, Inc., 2010.
3 B. Chun and Y. Kim, "A Method for Character Segm entation using MST," Journal of the Korea Society of Computer and Information, Vol.11, No.3, pp.73-78, July 2006.
4 P. Amat, W. Puech, S. Druon, and J. P. Pedeboy, "Lossless 3D Steganography Based on MST and Connectivity Modification," Image Communication, Vol.25, No.6, pp.400-412, July 2010.
5 Wikipedia, "Prim's Algorithm," http://en.wikipedia.org/wiki/Prims_algorithm, Wikimedia Foundation, Inc., 2010.
6 T. H. Cormen, C. E. Leiserson, R. L. Rivest, and Clifford Stein, "Introduction To Algorithms," Second Edition, The MIT Press, McGraw-Hill, 2002.
7 J. B. Kruskal, "On the Shortest Spanning Subtree and The Traveling Salesman Problem, " Proceedings of the American Mathematical Society, Vol 7, No. 1, pp. 48-50, Feb, 1956.   DOI   ScienceOn
8 Wikipedia, "Kruskal's Algorithm," http://en.wikipedia.org/wiki/Kruskal_algorithm, Wikimedia Foundation, Inc., 2010.
9 Michael T. Goodrich and Roberto Tamassia, "Data Structures and Algorithms in Java," Fourth Edition, John Wiley & Sons, Inc., 2006.
10 R. Sedgewick and K. Wayne, "Algorithms, " Fourth Edition, Addison-Wesley, 2011.
11 E. Horowitz, and S. Sahni, "Fundamentals of Data Structures in C," Anderson-Freed, 2008.
12 Jongman Goo, "Strategy of Algorithm Problem Solving," insight, 2012.
13 D. R. Karger, P. N. Klein, and R. E. Tarjan, "A randomized linear-time algorithm to find minimum spanning trees," Journal of the ACM (JACM) Vol 42, Issue 2, pp. 321-328, March 1995.   DOI   ScienceOn