An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs.
Yue-Li WangHon-Chan ChenChen-Yu LeePublished in: Inf. Process. Lett. (1995)
Keyphrases
- spanning tree
- parallel algorithm
- minimum spanning tree
- minimum spanning trees
- minimum cost
- parallel computation
- minimum weight
- undirected graph
- parallel programming
- lower bound
- weighted graph
- shared memory
- depth first search
- binary search trees
- worst case
- discovery of association rules
- medial axis transform
- processor array
- minimum total cost
- cluster of workstations
- parallel implementations
- edge weights
- np hard
- load balancing