Discrete Applied MathematicsVolume 110, Issues 2–3, 15 June 2001, Pages 213-225Searching for a minimal solution subgraph in explicit AND/OR graphsAuthor links open overlay panelDušan HvalicaShow moreShareCitehttps://doi.org/10.1016/S0166-218X(00)00271-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractAn 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.Previous article in issueNext article in issueKeywordsAND/OR graphMinimal solution subgraphTop–down searchRecommended articlesCited by (0)Copyright © 2001 Elsevier Science B.V. All rights reserved.