Login / Signup
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph.
Maumita Chakraborty
Ranjan Mehera
Rajat Kumar Pal
Published in:
Theor. Comput. Sci. (2022)
Keyphrases
</>
spanning tree
generation algorithm
minimum spanning tree
edge disjoint
minimum cost
minimum weight
undirected graph
minimum spanning trees
connected components
weighted graph
edge weights
root node
neighborhood graph
objective function
leaf nodes
np hard
minimum total cost
special case