Login / Signup
A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost
Barun Biswas
Krishnendu Basuli
Saptarshi Naskar
Saomya Chakraborti
Samar Sen-Sarma
Published in:
CoRR (2012)
Keyphrases
</>
spanning tree
weighted graph
minimum spanning tree
minimum weight
k means
minimum cost
times faster
multimedia
np hard
edge weights
minimum total cost
objective function
clustering method
distance transform
edge disjoint