A Case Study of Revisiting Best-First vs. Depth-First Search.

Andreas Auer Hermann Kaindl

Published in: ECAI (2004)

Keyphrases

depth first search
breadth first search
search tree
routing problem
iterative deepening
spanning tree
branch and bound
tree search
genetic algorithm
lower bound
special case
np hard
np complete