A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks.
Shih-Shun KaoJou-Ming ChangKung-Jui PaiJinn-Shyong YangShyue-Ming TangRo-Yu WuPublished in: COCOA (1) (2017)
Keyphrases
- spanning tree
- minimum weight
- minimum cost
- edge weights
- undirected graph
- depth first search
- edge disjoint
- minimum spanning tree
- minimum spanning trees
- network structure
- parallel implementation
- pairwise
- computer networks
- parallel processing
- shared memory
- worst case
- social networks
- optimal solution
- construction process
- np hard
- neural network
- minimum length
- bayesian networks
- parallel computing
- complex networks
- link prediction
- directed graph