Perimeter search in restricted memory

DOI10.1016/0898-1221(96)00154-XMaRDI QIDQ1352758zbMATH OpenFDO

Authors O. Diekmann

Publication date 22 June 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

backward pruningperimeter search technique

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Heuristic search in restricted memory
• scientific article; zbMATH DE number 3880462
• Breadth-first heuristic search

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• An Improved Bidirectional Heuristic Search Algorithm
• Bidirectional Heuristic Search Again
• Bidirectional heuristic search with limited resources
• Depth-first iterative-deepening: An optimal admissible tree search
• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• \(\text{BIDA}^*\): An improved perimeter search algorithm

This page was built for publication: Perimeter search in restricted memory

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