scientific article; zbMATH DE number 139778

MaRDI QIDQ4028101zbMATH OpenFDO

Authors Detlev Ruland, Ulrich Huckenbeck

Publication date 28 March 1993

zbMATH Keywords

pathsearch algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Paths and cycles (05C38)

Recommendations

• A general best first search algorithm in AND/OR graphs
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Best First Search Algorithm in AND/OR Graphs with Cycles
• On the optimality of a simple strategy for searching graphs
• Generalized best first search using single and multiple heuristics
• A solution to the GHI problem for best-first search
• Generalized best-first search strategies and the optimality of A*
• scientific article; zbMATH DE number 3920516

Cited in

(4)

• A general label search to investigate classical graph search algorithms
• AND/OR graph heuristic search methods
• Average-case analysis of best-first search in two representative directed acyclic graphs
• A solution to the GHI problem for best-first search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028101)