Best First Search Algorithm in AND/OR Graphs with Cycles

DOI10.1006/JAGM.1996.0039zbMATH Open0857.68029OpenAlexW2007673994MaRDI QIDQ4895799FDOQ4895799

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

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

Cited In (4)

• An efficient algorithm for searching implicit AND/OR graphs with cycles
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• Title not available (Why is that?)
• 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)