Best First Search Algorithm in AND/OR Graphs with Cycles

DOI10.1006/JAGM.1996.0039MaRDI QIDQ4895799zbMATH OpenOpenAlexFDO

Authors Dušan Hvalica

Publication date 16 October 1996

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

Full work available at URL https://doi.org/10.1006/jagm.1996.0039

zbMATH Keywords

best first search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• An efficient algorithm for searching implicit AND/OR graphs with cycles
• A generalized best-first search method in graphs
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• Searching for a minimal solution subgraph in explicit AND/OR graphs

This page was built for publication: Best First Search Algorithm in AND/OR Graphs with Cycles

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