most citedA combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2012★ 2 cited

A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost

Barun Biswas, Krishnendu Basuli, Saptarshi Naskar +2

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 pap…