A Parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube.
Zhiyong PanBaolei ChengJianxi FanHuanwen ZhangPublished in: PAAP (2021)
Keyphrases
- spanning tree
- parallel algorithm
- root node
- undirected graph
- edge weights
- minimum spanning tree
- edge disjoint
- leaf nodes
- minimum cost
- parallel computation
- weighted graph
- minimum spanning trees
- shared memory
- graph structure
- binary search trees
- cluster of workstations
- parallel version
- parallel implementations
- depth first search
- parallel programming
- directed graph
- minimum total cost
- medial axis transform
- total length
- discovery of association rules
- processor array
- search tree
- tree structure