An O(log n) Parallel Time Depth-First Search Algorithm for Solid Grid Graphs.
Jun-Ho HerR. S. RamakrishnaPublished in: HPCNCS (2007)
Keyphrases
- search algorithm
- graph search
- depth first search
- search tree
- search strategy
- branch and bound
- search space
- lower bound
- three dimensional
- heuristic search
- alpha beta
- parallel processing
- shared memory
- parallel implementation
- subgraph isomorphism
- iterative deepening
- search problems
- graph theoretic
- graph theory
- tabu search
- path finding