ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

An Approach of MST Generation Algorithm Based on Node Weightage

Journal: International Journal of Advanced Networking and Applications (Vol.1, No. 03)

Publication Date:

Authors : ; ;

Page : 154-158

Keywords : Graph; Subgraph; Tree; Spanning Tree; Minimal Spanning Tree; Weightage;

Source : Downloadexternal Find it from : Google Scholarexternal

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, optimization of network cost, and mobile computing.

Last modified: 2015-12-05 20:55:31