Login / Signup
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes.
Kung-Jui Pai
Ruay-Shiung Chang
Jou-Ming Chang
Ro-Yu Wu
Published in:
FAW (2019)
Keyphrases
</>
spanning tree
completely independent
edge disjoint
minimum spanning tree
minimum cost
finite state
minimum spanning trees
undirected graph
window search
depth first search
data cube
weighted graph
lowest cost
dimensionality reduction