Spanning trees with bounded degrees and leaves.

Mikio Kano Zheng Yan

Published in: Discret. Math. (2016)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
minimum weight
undirected graph
depth first search
weighted graph
computational complexity
simulated annealing
metaheuristic
euclidean distance
lowest cost