Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
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
|Collections||ANU Research Publications|
|Source:||Implementing Modal Tableaux Using Sentential Decision Diagrams|
|01_Everitt_Analytical_Results_on_the_BFS_2015.pdf||413.96 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.