Australasian Joint Conference on Artificial Intelligence

AI 2015: Advances in Artificial Intelligence pp 157-165

Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search

Conference paper

DOI: 10.1007/978-3-319-26350-2_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9457)
Cite this paper as:
Everitt T., Hutter M. (2015) Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search. In: Pfahringer B., Renz J. (eds) AI 2015: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 9457. Springer, Cham

Abstract

Breadth-first search (BFS) and depth-first search (DFS) are the two most fundamental search algorithms. We derive approximations of their expected runtimes in complete trees, as a function of tree depth and probabilistic goal distribution. We also demonstrate that the analytical approximations are close to the empirical averages for most parameter settings, and that the results can be used to predict the best algorithm given the relevant problem features.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Australian National UniversityCanberraAustralia

Personalised recommendations