A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost
Data Structures and Algorithms
2012-09-20 v1
Abstract
The most popular algorithms for generation of minimal spanning tree are Kruskal and Prim algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix; it is little bit modification of FCM.
Keywords
Cite
@article{arxiv.1209.4206,
title = {A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost},
author = {Barun Biswas and Krishnendu Basuli and Saptarshi Naskar and Saomya Chakraborti and Samar Sen Sarma},
journal= {arXiv preprint arXiv:1209.4206},
year = {2012}
}