Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes.
Baolei ChengJianxi FanXiaohua JiaJin WangPublished in: J. Parallel Distributed Comput. (2013)
Keyphrases
- spanning tree
- depth first search
- leaf nodes
- minimum spanning tree
- minimum cost
- root node
- edge disjoint
- decision trees
- multiple independent
- minimum spanning trees
- parallel processing
- parallel implementation
- weighted graph
- data cube
- undirected graph
- parallel computing
- multi dimensional
- times faster
- data management
- temporal dimension
- lower bound