Spanning trees with leaf distance at least four.

Atsushi Kaneko Mikio Kano Kazuhiro Suzuki

Published in: J. Graph Theory (2007)

Keyphrases

spanning tree
edge disjoint
leaf nodes
minimum spanning tree
minimum cost
minimum spanning trees
edge weights
distance measure
euclidean distance
decision trees
minimum distance
undirected graph
special case
distance transform
hamming distance
weighted graph
depth first search
distance metric
probabilistic model