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