Independent spanning trees with small depths in iterated line digraphs.

Toru Hasunuma Hiroshi Nagamochi

Published in: Discret. Appl. Math. (2001)

Keyphrases

spanning tree
edge disjoint
undirected graph
small number
vanishing points
minimum spanning tree
minimum spanning trees
three dimensional
knn
worst case
markov chain
line segments
directed graph
minimum cost
sufficiently small