Searching for a minimal solution subgraph in explicit AND/OR graphs

https://doi.org/10.1016/S0166-218X(00)00271-7Get rights and content
Under an Elsevier user license
open archive

Abstract

An algorithm for searching for a minimal solution subgraph in AND/OR graphs with cycles is described, which works top–down and is appropriate to explicit AND/OR graphs.

Keywords

AND/OR graph
Minimal solution subgraph
Top–down search

Cited by (0)