The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

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

2-간선 연결 그래프를 사용한 최소신장트리 알고리즘 제안

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 과학기술대학 멀티미디어공학과)
  • Received : 2014.04.15
  • Accepted : 2014.08.08
  • Published : 2014.08.31
Download PDF
⟨ Previous Next ⟩

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.

본 논문은 원 그래프를 2-간선 연결 그래프로 단순화하고, 사이클 속성을 적용하여 최소신장트리를 빠르게 얻는 알고리즘을 제안하였다. Borůvka 알고리즘은 정점 (v) 당 최소 가중치 간선 (v) 을 1개씩 선택하는 1-간선 연결 그래프에 대해 사이클 속성을 적용하여 부분신장트리를 얻는다. 추가적으로 절단속성을 적용하여 부분신장트리를 연결하는 최소 가중치 간선을 선택한다. Kruskal 알고리즘은 그래프의 모든 간선을 대상으로 오름차순으로 절단 속성을 적용한다. 역-삭제 알고리즘은 내림차순으로 사이클 속성을 적용한다. Borůvka, Kruskal과 역-삭제 알고리즘은 모든 간선들을 대상으로 하기 때문에 항상 |e| 회 수행된다. 제안된 알고리즘은 첫 번째로, 정점 당 최소 가중치 간선을 2개씩 선택하는 2-간선 연결 그래프를 얻는다. 두 번째로, 2-간선 연결 그래프에 대해 사이클 속성을 적용하여 |e|=|v|-1 일 때 알고리즘을 종료시켰다. 제안된 방법들을 10개의 실제 그래프들에 적용한 결과 모두 최소신장트리를 얻는데 성공하였다. 또한, Borůvka, Kruskal과 역-삭제 알고리즘에 비해 수행 횟수를 60% 단축시켰다.

Keywords

References

  1. Wikipedia, "Minimum Spanning Tree," http://en.wikipedia.org/wiki/Minimum_spanning_tree, Wikimedia Foundation, Inc., 2014.
  2. J. Kleinberg and E. Tardos, "Algorithm Design," Addison-Wesley, 2004.
  3. O. Boruvka, "O Jistem Problemu Minimalnim," Prace Mor. Prrodved. Spol. V Brne (Acta Societ. Natur. Moravicae), Vol. III, No. 3, pp. 37-58, 1926.
  4. 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. https://doi.org/10.1016/S0012-365X(00)00224-7
  5. R. C. Prim, "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol. 36, No. 6, pp. 1389-1401, Nov. 1957. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
  6. 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.
  7. Wikipedia, "Reverse-Delete Algorithm," http://en.wikipedia.org/wiki/Reverse_delete_algorithm, Wikimedia Foundation, Inc., 2014.
  8. Wikipedia, "Graph (mathematics)," http://en.wikipedia.org/wiki/Graph_(mathematics), Wikimedia Foundation, Inc., 2014.
  9. 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.
  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. https://doi.org/10.7236/JIIBC.2013.13.4.107
  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. https://doi.org/10.7236/JIIBC.2014.14.1.51
  13. WWL. Chen, "Discrete Mathematics," Department of Mathematics, Division of ICS, Macquarie University, Australia, 2003.
  14. C. Peiper, CS 400 - Data Structures for Non CS-Majors," http://www.cs.uiuc.edu/class/fa05/ s400/_labs/Lab12/suuri/, 2005.
  15. Wikipedia, "Prim's Algorithm," http://en.ikipedia.org/wiki/Prims_algorithm, Wikimedia Foundation, Inc., 2014.