The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A generalization of Dijkstra's algorithm
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 24,043
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Self-citationThe Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Self-citationThe Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Optimal Code Generation for Expression Trees
Aho, A. V., & Johnson, S. C. (1976) · Journal of the ACM · doi:10.1145/321958.321970 · Cited by 242
Martelli, A., & Montanari, U. (1973) · International Joint Conference on Artificial Intelligence · Cited by 127
Cited by
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 2,656
Recent automatic text summarization techniques: a survey
Gambhir, M., & Gupta, V. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9475-9 · Cited by 727
Types and persistence in database programming languages
Atkinson, M. P., & Buneman, O. P. (1987) · ACM Computing Surveys · doi:10.1145/62070.45066 · Cited by 344
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
Huang, L., & Chiang, D. (2005) · Proceedings of the Ninth International Workshop on Parsing Technology - Parsing '05 · doi:10.3115/1654494.1654500 · Cited by 291
Metadata
- Authors
- Knuth, D. E.
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 1977-02
- Volume
- 6
- Issue
- 1
- Pages
- 1-5
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W1975638108
- Cited by
- 263
- References
- 7
- FWCI
- 1.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A generalization of Dijkstra's algorithm. https://app.cochat.ai/papers/10.1016/0020-0190(77)90002-3
- The paper
- Knuth, D. E. (1977). A generalization of Dijkstra's algorithm. Information Processing Letters. https://doi.org/10.1016/0020-0190(77)90002-3
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.