Edge-disjoint spanning trees: A connectedness theorem.

M. Farber B. Richter H. Shank

Published in: J. Graph Theory (1985)

Keyphrases

edge disjoint
spanning tree
total length
minimum spanning tree
minimum cost
von neumann
minimum spanning trees
data sets
minimum weight
running times
undirected graph
root node
connected components
weighted graph
multi dimensional
lower bound
data structure
neural network