External A*
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms for Memory HierarchiesLecture Notes in Computer Science, 2003
- External-Memory Breadth-First Search with Sublinear I/OLecture Notes in Computer Science, 2002
- A general lower bound on the I/O-complexity of comparison-based algorithmsLecture Notes in Computer Science, 1993
- The I/O complexity of sorting and related problemsLecture Notes in Computer Science, 1987
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968