The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Linear-space best-first search
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
Self-citationGeneralized best-first search strategies and the optimality of A*
Dechter, R., & Pearl, J. (1985) · Journal of the ACM · doi:10.1145/3828.3830 · Cited by 1,071
Korf, R. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90054-4 · Cited by 917
Self-citationHeuristic search viewed as path finding in a graph
Pohl, I. (1970) · Artificial Intelligence · doi:10.1016/0004-3702(70)90007-x · Cited by 433
Finding a shortest solution for the N x N extension of the 15- Puzzle is intractable
Ratner, D., & Warmuth, M. K. (1986) · National Conference on Artificial Intelligence · Cited by 181
Heuristic search in restricted memory
Chakrabarti, P. P., Ghose, S., Acharya, A., et al. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90010-6 · Cited by 120
Pruning Duplicate Nodes in Depth-First Search
Taylor, L. A., & Korf, R. E. (1993) · Cited by 70
Self-citationAn analysis of consecutively bounded depth-first search with applications in automated deduction
Stickel, M. E., & Tyson, W. M. (1985) · International Joint Conference on Artificial Intelligence · Cited by 58
Cited by
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Learning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
A Tutorial on Learning with Bayesian Networks
Heckerman, D. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-85066-3_3 · Cited by 1,693
A Tutorial on Learning with Bayesian Networks
Heckerman, D. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_11 · Cited by 1,220
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Metadata
- Authors
- Korf, R. E.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1993-07
- Volume
- 62
- Issue
- 1
- Pages
- 41-78
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2009833344
- Cited by
- 305
- References
- 12
- FWCI
- 14.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.