Improving the efficiency of depth-first search by cycle elimination

DOI10.1016/0020-0190(93)90244-4MaRDI QIDQ1209308zbMATH OpenOpenAlexFDO

Authors John F. Dillenburg, Peter C. Nelson

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90244-4

zbMATH Keywords

cycle checkingheuristic searchroute planning problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Depth-first iterative-deepening: An optimal admissible tree search
• An efficient algorithm for searching implicit AND/OR graphs with cycles
• Agent searching in a tree and the optimality of iterative deepening
• Breadth-first heuristic search
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds

Cites work

• Depth-first iterative-deepening: An optimal admissible tree search
• scientific article; zbMATH DE number 4162303 (Why is no real title available?)
• On the asymptotic performance of IDA

Cited in

(1)

• scientific article; zbMATH DE number 3990867 (Why is no real title available?)

This page was built for publication: Improving the efficiency of depth-first search by cycle elimination

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