Open Access   Article Go Back

A Survey on: Comparative Study of Minimum Spanning Tree Algorithm

R. Gomathijayam1 , V. Santhi2

  1. Department of Computer Applications, Bon Secours College for Women, Thanjavur, India.
  2. Department of Computer Applications, Bon Secours College for Women, Thanjavur, India.

Correspondence should be addressed to: rgj.tnj@gmail.com.

Section:Survey Paper, Product Type: Journal Paper
Volume-5 , Issue-12 , Page no. 249-253, Dec-2017

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v5i12.249253

Online published on Dec 31, 2017

Copyright © R. Gomathijayam, V. Santhi . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

IEEE Style Citation: R. Gomathijayam, V. Santhi, “A Survey on: Comparative Study of Minimum Spanning Tree Algorithm,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.249-253, 2017.

MLA Style Citation: R. Gomathijayam, V. Santhi "A Survey on: Comparative Study of Minimum Spanning Tree Algorithm." International Journal of Computer Sciences and Engineering 5.12 (2017): 249-253.

APA Style Citation: R. Gomathijayam, V. Santhi, (2017). A Survey on: Comparative Study of Minimum Spanning Tree Algorithm. International Journal of Computer Sciences and Engineering, 5(12), 249-253.

BibTex Style Citation:
@article{Gomathijayam_2017,
author = {R. Gomathijayam, V. Santhi},
title = {A Survey on: Comparative Study of Minimum Spanning Tree Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {12 2017},
volume = {5},
Issue = {12},
month = {12},
year = {2017},
issn = {2347-2693},
pages = {249-253},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1611},
doi = {https://doi.org/10.26438/ijcse/v5i12.249253}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i12.249253}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1611
TI - A Survey on: Comparative Study of Minimum Spanning Tree Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - R. Gomathijayam, V. Santhi
PY - 2017
DA - 2017/12/31
PB - IJCSE, Indore, INDIA
SP - 249-253
IS - 12
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
740 483 downloads 291 downloads
  
  
           

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.

Key-Words / Index Term

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

References

[1] Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekarn, “Fundamentals of Computer Algorithms (2nd Ed.)”, University Press (India) Private Ltd. – 500 029, pp. 236.
[2] 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.
[3] Abdullah-Al Mamun, Sanguthevar Rajasekaran, “An Efficient Minimum Spanning Tree Algorithm”, IEEE Symposium on Computers and Communication, (ISCC),pp. 1-2, 2016.
[4] 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.
[5] 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.
[6] 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.
[7] 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.
[8] 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.
[9] Chaojun Li, "Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions", Dave Mount, pp.2-4, 2014.
[10] K. Lakshmi1, T. Meyyappan, “Spanning Tree- Properties, Algorithms and Applications”, International Journal of Computer Sciences and Engineering, pp-4, Vol.5(10), 2017.