Completely independent spanning trees in the underlying graph of a line digraph.

Published in: Discret. Math. (2001)

Keyphrases

spanning tree
completely independent
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
weighted graph
edge weights
minimum weight
undirected graph
root node
depth first search
heat kernel
np hard
graph structure
connected components
machine learning
series parallel
total length
random walk