Improving the efficiency of depth-first search by cycle elimination

DOI10.1016/0020-0190(93)90244-4zbMath0795.68173OpenAlexW2034920892MaRDI QIDQ1209308

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

heuristic searchcycle checkingroute planning problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• On the asymptotic performance of IDA

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