An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs.
Hirotoshi HonmaSaki HonmaShigeru MasuyamaPublished in: IEICE Trans. Inf. Syst. (2009)
Keyphrases
- spanning tree
- parallel algorithm
- minimum cost
- minimum spanning tree
- minimum spanning trees
- binary search trees
- parallel computation
- minimum weight
- undirected graph
- shared memory
- cluster of workstations
- weighted graph
- np hard
- optimal solution
- parallel programming
- approximation algorithms
- dynamic programming
- depth first search
- special case
- medial axis transform
- dominant points
- database server
- edge weights
- worst case
- objective function