An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs.
H. S. ChaoFang-Rong HsuRichard C. T. LeePublished in: Inf. Process. Lett. (1997)
Keyphrases
- parallel algorithm
- binary search trees
- search tree
- search algorithm
- parallel computation
- iterative deepening
- shared memory
- search space
- depth first search
- branch and bound algorithm
- cluster of workstations
- multicore processors
- dynamic programming
- optimal solution
- tree search
- orders of magnitude
- multi dimensional
- special case
- genetic algorithm