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

Proposal of Minimum Spanning Tree Algorithm using 2-Edges Connected Grap  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.14, no.4, 2014 , pp. 233-241 More about this Journal
Abstract
This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.
Keywords
Minimum spanning tree; Cycle property; Cut property; 2-edges connected graph; Minimum weight edge;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
2 R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, No. 6, pp. 1389-1401, Nov. 1957.   DOI
3 Wikipedia, "Minimum Spanning Tree," http://en.wikipedia.org/wiki/Minimum_spanning_tree, Wikimedia Foundation, Inc., 2014.
4 J. Kleinberg and E. Tardos, "Algorithm Design," Addison-Wesley, 2004.
5 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.
6 Wikipedia, "Reverse-Delete Algorithm," http://en.wikipedia.org/wiki/Reverse_delete_algorithm, Wikimedia Foundation, Inc., 2014.
7 Wikipedia, "Graph (mathematics)," http://en.wikipedia.org/wiki/Graph_(mathematics), Wikimedia Foundation, Inc., 2014.
8 M. B. Choi and S. U. Lee, "Generalized Boruvkas Minimum Spanning Tree Algorithm," Journal of Institute of Internet, Broadcasting and Communication, Vol. 12, No. 6, pp. 165-173, Dec. 2012.
9 WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, 2003.
10 M. B. Choi and S. U. Lee, "An Efficient Implementation of Kruskal's and Reverse- Delete Minimum Spanning Tree Algorithm," Journal of Institute of Internet, Broadcasting and Communication, Vol. 13, No. 2, pp. 103-114, Apr. 2013.
11 M. B. Choi and S. U. Lee, "Select and Delete Minimum Spanning Tree Algorithm," Journal of Institute of Internet, Broadcasting and Communication, Vol. 13, No. 4, pp. 107-116, Aug. 2013.   과학기술학회마을   DOI
12 S. U. Lee and M. B. Choi, "Fast Determination of Minimum Spanning Tree Based on Down-sizing the Population of Edges," Journal of Institute of Internet, Broadcasting and Communication, Vol. 14, No. 1, pp. 51-59, Feb. 2014.   과학기술학회마을   DOI
13 C. Peiper, CS 400 - Data Structures for Non CS-Majors," http://www.cs.uiuc.edu/class/fa05/ s400/_labs/Lab12/suuri/, 2005.
14 Wikipedia, "Prim's Algorithm," http://en.ikipedia.org/wiki/Prims_algorithm, Wikimedia Foundation, Inc., 2014.
15 J. Nesetril, E. Milkova, and H. Nesetrilova, "Otakar Boruvka on Minimum Spanning Tree Problem (Translation of the both 1926 Papers, Comments, History)," DMATH: Discrete Mathematics, Vol. 233, No. 1-3, pp. 3-36, Apr. 2001.   DOI   ScienceOn