Spanning trees whose stems have at most k leaves.

Mikio Kano Zheng Yan

Published in: Ars Comb. (2014)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
minimum cost

depth first search
minimum spanning trees
minimum weight
undirected graph

root node
lowest cost
data sets
neural network

search engine
data structure
lower bound
weighted graph