Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search

Thumbnail Image

Date

2015

Authors

Everitt, Tom
Hutter, Marcus

Journal Title

Journal ISSN

Volume Title

Publisher

Springer International Publishing AG

Abstract

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

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/103801

Collections

ANU Research Publications

Source

Implementing Modal Tableaux Using Sentential Decision Diagrams

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

10.1007/978-3-319-26350-2_15

Restricted until

2037-12-31

Downloads

File
Description
01_Everitt_Analytical_Results_on_the_BFS_2015.pdf (361.66 KB)

DSpace software copyright © 2002-2026 LYRASIS