The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Shortest paths algorithms: Theory and experimental evaluation
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
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
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 756
Faster algorithms for the shortest path problem
Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990) · Journal of the ACM · doi:10.1145/77600.77615 · Cited by 554
Design and implementation of an efficient priority queue
Boas, P. V. E., Kaas, R., & Zijlstra, E. (1976) · Theory of Computing Systems · doi:10.1007/bf01683268 · Cited by 521
Cited by
Lehner, B., & Grill, G. (2013) · Hydrological Processes · doi:10.1002/hyp.9740 · Cited by 2,193
A graph-based system for network-vulnerability analysis
Phillips, C., & Swiler, L. P. (1998) · Proceedings of the 1998 workshop on New security paradigms · doi:10.1145/310889.310919 · Cited by 828
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Finding shortest paths on real road networks: the case for A*
Zeng, W., & Church, R. L. (2009) · International Journal of Geographical Information Science · doi:10.1080/13658810801949850 · Cited by 327
Tortuosity of porous media: Image analysis and physical simulation
Fu, J., Thomas, H. R., & Li, C. (2021) · Earth-Science Reviews · doi:10.1016/j.earscirev.2020.103439 · Cited by 292
Metadata
- Authors
- Cherkassky, B. V., Goldberg, A. V., & Radzik, T.
- Venue
- Mathematical Programming
- Published
- 1996-05
- Volume
- 73
- Issue
- 2
- Pages
- 129-174
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W3137299218
- Cited by
- 743
- References
- 18
- FWCI
- 16.49
- 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: Shortest paths algorithms: Theory and experimental evaluation. https://app.cochat.ai/papers/10.1007/bf02592101
- The paper
- Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996). Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming. https://doi.org/10.1007/bf02592101
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.