A Survey on: Comparative Study of Minimum Spanning Tree Algorithm

Authors

  • R Gomathijayam Department of Computer Applications, Bon Secours College for Women, Thanjavur, India
  • V Santhi Department of Computer Applications, Bon Secours College for Women, Thanjavur, India

DOI:

https://doi.org/10.26438/ijcse/v5i12.249253

Keywords:

MST, Graph, GA – Genetic Algorithm, DCC_Trees, DWCM - Difference Weighted Circuit Matrix

Abstract

Minimum spanning tree can be obtained for undirected connected weighted edges with no negative weight using conventional algorithms such as genetic, Prim’s and Filter-Kruskal. This paper presents a survey on the conventional and the more recent algorithms with different techniques. This survey paper also contains comparisons of MST algorithm and their advantages and limitations.

References

Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekarn, “Fundamentals of Computer Algorithms (2nd Ed.)”, University Press (India) Private Ltd. – 500 029, pp. 236.

Nimesh Patel, Dr. K. M. Patel, “A Survey on: Enhancement of Minimum Spanning Tree”, Nimesh Patel Int. Journal of Engineering Research and Applications, India, pp. 1, 2015.

Abdullah-Al Mamun, Sanguthevar Rajasekaran, “An Efficient Minimum Spanning Tree Algorithm”, IEEE Symposium on Computers and Communication, (ISCC),pp. 1-2, 2016.

Hong Liu, GenguiZhou, “Minimum Spanning Tree Problem Research based on Genetic Algorithm”, 2nd International Symposium on Computational Intelligence and Design, China, pp. 1-5, 2009.

P.Praveen, B. Rama, T.Sampath Kumar, “An Efficient clustering algorithm of Minimum Spanning Tree”, 3rd International Conferences on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics, pp. 1-5, 2017.

Jerry John Kponyo , Yujun Kuang , Enzhan Zhang , Kamenyi Domenic, “VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim Clustering Algorithm”, in the proceedings of ICCP2013, China, pp. 2, 2013.

Maumita Chakraborty, Ranjan Mehera and Rajat Kumar Pal, “A Divide-and- Conquer Algorithm for All Spanning Tree Generation”, Springer Nature Singapore Pte Ltd., R. Chaki et al. (eds.), Advanced Computing and Systems for Security, Advances in Intelligent Systems and Computing 567, pp. 6,14, 2017.

Barun Biswas, Krishnendu Basuli, Saptarshi Naskar, Saomya Chakraborti and Samar Sen Sarma, "A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost", CoRR, India, pp.2,3, 2012.

Chaojun Li, "Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions", Dave Mount, pp.2-4, 2014.

K. Lakshmi1, T. Meyyappan, “Spanning Tree- Properties, Algorithms and Applications”, International Journal of Computer Sciences and Engineering, pp-4, Vol.5(10), 2017.

Downloads

Published

2025-11-12
CITATION
DOI: 10.26438/ijcse/v5i12.249253
Published: 2025-11-12

How to Cite

[1]
R. Gomathijayam and V. Santhi, “A Survey on: Comparative Study of Minimum Spanning Tree Algorithm”, Int. J. Comp. Sci. Eng., vol. 5, no. 12, pp. 249–253, Nov. 2025.

Issue

Vol. 5 No. 12 (2017): IJCSE December Edition

Section

Survey Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.