A general best first search algorithm in AND/OR graphs

DOI10.1016/0196-6774(92)90014-4MaRDI QIDQ3990604zbMATH OpenOpenAlexFDO

Authors Sujoy Ghose, P. P. Chakrabarti

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90014-4

zbMATH Keywords

AND/OR graphsGEN-AO\(^*\)maximizationminimization

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Generalized best first search using single and multiple heuristics
• AND/OR graph heuristic search methods
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• Generalized best-first search strategies and the optimality of A*
• A general heuristic bottom-up procedure for searching AND/OR graphs

Cited in

(10)

• Generalized best first search using single and multiple heuristics
• Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph
• A solution to the GHI problem for best-first search
• Subproblem ordering heuristics for AND/OR best-first search
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Algorithms for generating ordered solutions for explicit AND/OR structures
• AND/OR graph heuristic search methods
• scientific article; zbMATH DE number 139778 (Why is no real title available?)
• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• Average-case analysis of best-first search in two representative directed acyclic graphs

This page was built for publication: A general best first search algorithm in AND/OR graphs

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