Login / Signup
Constructing independent spanning trees with height n on the n-dimensional crossed cube.
Baolei Cheng
Jianxi Fan
Qiang Lyu
Jingya Zhou
Zhao Liu
Published in:
Future Gener. Comput. Syst. (2018)
Keyphrases
</>
spanning tree
multi dimensional
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
undirected graph
database
root node
data cube
edge weights
data sets
databases
multimedia
upper bound
total length