The Average Complexity of Depth-First Search with Backtracking and Cutoff.
Harold S. StonePaolo SipalaPublished in: IBM J. Res. Dev. (1986)
Keyphrases
- depth first search
- search tree
- tree search
- breadth first search
- search algorithm
- worst case
- constraint satisfaction
- branch and bound
- search space
- computational complexity
- parallel tree search
- branching factor
- routing problem
- spanning tree
- nearest neighbor
- branch and bound algorithm
- multi dimensional
- dynamic programming