An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree.
Prasoon TiwariPublished in: J. Algorithms (1986)
Keyphrases
- parallel algorithm
- spanning tree
- depth first search
- minimum cost
- minimum spanning tree
- parallel computation
- minimum weight
- search algorithm
- minimum spanning trees
- parallel version
- shared memory
- search strategy
- parallel implementations
- edge weights
- discovery of association rules
- parallel programming
- processor array
- medial axis transform
- cluster of workstations
- dominant points
- undirected graph
- branch and bound
- search space