Constructing edge-disjoint spanning trees in twisted cubes.

Ming-Chien Yang

Published in: Inf. Sci. (2010)

Keyphrases

edge disjoint
spanning tree
total length
minimum spanning tree
minimum cost
minimum spanning trees
depth first search
running times
undirected graph
edge weights
root node
window search
minimum total cost
weighted graph
query processing
data mining
association rules
data structure