Login / Signup
Dirac's Condition for Completely Independent Spanning Trees.
Toru Araki
Published in:
J. Graph Theory (2014)
Keyphrases
</>
spanning tree
completely independent
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
sufficient conditions
finite state
undirected graph
minimum total cost
weighted graph
edge weights
root node
data sets
markov chain
search algorithm