Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search
- Cite this paper as:
- Everitt T., Hutter M. (2015) Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search. In: Pfahringer B., Renz J. (eds) AI 2015: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 9457. Springer, Cham
The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper (Everitt and Hutter 2015b), expected runtime was approximated as a function of search depth and probabilistic goal distribution for tree search versions of breadth-first search (BFS) and depth-first search (DFS). Here we provide an analogous analysis of BFS and DFS graph search, deriving expected runtime as a function of graph structure and goal distribution. The applicability of the method is demonstrated through analysis of two different grammar problems. The approximations come surprisingly close to empirical reality.