An efficient distributed algorithm for constructing a breadth-first search tree.
Jungho ParkNobuki TokuraToshimitsu MasuzawaKenichi HagiharaPublished in: Systems and Computers in Japan (1989)
Keyphrases
- search tree
- search space
- computational complexity
- bin packing
- memory efficient
- dynamic programming
- databases
- iterative deepening
- depth first search
- optimal solution
- cost function
- particle swarm optimization
- search strategy
- branch and bound search
- search strategies
- simulated annealing
- np hard
- special case
- data streams
- search algorithm
- database systems