Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees.

Benoît Darties Nicolas Gastineau Olivier Togni

Published in: CoRR (2017)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
completely independent
minimum cost
minimum weight
undirected graph
root node
minimum spanning trees
sufficient conditions
weighted graph
depth first search
pairwise
total length
data management
minimum total cost
np hard