Abstract: Importance of minimum spanning tree is used to find the smallest path which includes all the nodes in the network. Minimum spanning tree can be obtained using classical algorithms such as, Boruvka’s, Prim’s, and Kruskal. This research paper contains a survey on the classical and recent algorithms which used different techniques to find minimum spanning tree. This research paper includes a new method to generate a Minimum Spanning Tree. It also contains comparisons of Minimum Spanning Tree algorithms with new proposed algorithms and its simulation results.
Publication Year: 2016
Publication Date: 2016-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot