A tight bound on the collection of edges in MSTs of induced subgraphs.

Gregory B. Sorkin Angelika Steger Rico Zenklusen

Published in: J. Comb. Theory, Ser. B (2009)

Keyphrases

lower bound
upper bound
worst case
generalization error bounds
document collections
edge detector
objective function
edge information
np hard
data structure
database
error bounds
digital libraries
graph mining
spanning tree
undirected graph
graph data
image edges
distributed information retrieval