Login / Signup
On edge-disjoint spanning trees with small depths.
Toru Hasunuma
Published in:
Inf. Process. Lett. (2000)
Keyphrases
</>
edge disjoint
spanning tree
total length
minimum cost
minimum spanning tree
small number
minimum spanning trees
undirected graph
computational complexity
depth map
genetic algorithm
special case
upper bound
times faster
data sets
depth first search
lowest cost
minimum total cost