Approximating Maximum Leaf Spanning Trees in Almost Linear Time.

Hsueh-I Lu R. Ravi

Published in: J. Algorithms (1998)

Keyphrases

spanning tree
leaf nodes
edge disjoint
minimum spanning tree
minimum spanning trees
minimum cost
undirected graph
worst case
depth first search
data sets
neural network
search engine
root node
bayesian networks
lower bound
data management