A Classical Approach of MST Generation Based on Weightage Pal Sanjay Kumar1,*, Sarma Samar Sen2 1Department of Computer Science and Applications, NSHM College of Management & Technology, Kolkata - 700 053, India 2Department of Computer Science & Engineering, University of Calcutta, Kolkata - 700 009, India *E-mail: pal.sanjaykumar@gmail.com
Online published on 10 August, 2015. Abstract This paper considers generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we propose a new algorithm to find out minimal spanning tree of the graph G based on the weightage of nodes in graph. The time complexity of the problem is in polynomial order with better execution time comparing to the existing algorithms. The goal is to design an algorithm that is simple, elegant, easy to understand and applicable in field of networking design and mobile computing. Top Keywords Graph, tree, spanning tree, minimal spanning tree, weightage. Top |