acm - an acm publication


Renovation of minimum spanning tree algorithms of weighted graph

Ubiquity, Volume 2008 Issue February | BY Sanjay Kumar Pal 


Full citation in the ACM Digital Library

In this paper we describe and explain the Minimum Spanning Tree (MST) generation algorithms of a weighted graph with renovated idea. Here, we used a new cycle testing algorithm for testing cycles, if required, in generation of Minimum Spanning Tree. The reason behind this is to optimize the execution time for cycle testing. Also, we describe some Minimum Spanning Tree algorithms for weighted graph with a renovated idea. We applied here new concept for explanation of minimum Spanning tree with better time complexity.

Connection Failure


Leave this field empty