Spanning trees with at most k leaves in 2-connected K1,r-free graphs.

Guantao Chen Yuan Chen Zhiquan Hu Shunzhe Zhang

Published in: Appl. Math. Comput. (2023)

Keyphrases

spanning tree
minimum spanning tree
minimum spanning trees
minimum cost
edge disjoint
undirected graph
minimum weight
weighted graph
edge weights
depth first search
minimum total cost
connected components
neighborhood graph
lowest cost
root node
optimization problems
np hard