Improved bounds for spanning trees with many leaves.

Paul S. Bonsma Florian Zickfeld

Published in: Discret. Math. (2012)

Keyphrases

spanning tree
edge disjoint
minimum spanning trees
minimum spanning tree
lower bound
upper bound
minimum cost
error bounds
improved algorithm
undirected graph
worst case
depth first search
minimum total cost
shortest path
data sets
upper and lower bounds
knn
heat kernel
bayesian networks
decision trees