-tree and a graph with a polynomially bounded number of spanning trees.

Atsuko Yamaguchi Kiyoko F. Aoki Hiroshi Mamitsuka

Published in: Inf. Process. Lett. (2004)

Keyphrases

spanning tree
minimum spanning tree
edge disjoint
edge weights
undirected graph
leaf nodes
root node
minimum weight
small number
minimum cost
minimum spanning trees
polynomially bounded
minimum total cost
tree structure
tree nodes
graph theory
graph matching
data structure