Login / Signup
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees.
Benoît Darties
Nicolas Gastineau
Olivier Togni
Published in:
Discret. Appl. Math. (2018)
Keyphrases
</>
spanning tree
edge disjoint
completely independent
minimum spanning tree
minimum cost
minimum weight
undirected graph
minimum spanning trees
depth first search
root node
total length
upper bound
weighted graph
high level
leaf nodes
approximation algorithms
sufficient conditions
pairwise
lower bound