The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Shortest path algorithms
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
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
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
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
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
The Art of Computer Programming, Vol. 3: Sorting and Searching
McClellan, M. T., Minker, J., & Knuth, D. E. (1974) · Mathematics of Computation · doi:10.2307/2005383 · Cited by 910
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 756
Williams, J. W. J. (1964) · Communications of the ACM · doi:10.1145/512274.3734138 · Cited by 527
Algorithm 360: shortest-path forest with topological ordering [H]
Dial, R. B. (1969) · Communications of the ACM · doi:10.1145/363269.363610 · Cited by 369
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Denardo, E. V., & Fox, B. L. (1979) · Operations Research · doi:10.1287/opre.27.1.161 · Cited by 198
A performance comparison of labeling algorithms for calculating shortest path trees
Gilsinn, J. F. (1973) · doi:10.6028/nbs.tn.772 · Cited by 73
Computational study of an improved shortest path algorithm
Glover, F., Glover, R., & Klingman, D. D. (1984) · Networks · doi:10.1002/net.3230140103 · Cited by 69
Improved shortest path algorithms for transport networks
Vliet, D. V. (1978) · Transportation Research · doi:10.1016/0041-1647(78)90102-8 · Cited by 66
Complexity of Combinatorial Algorithms
Tarjan, R. E. (1978) · SIAM Review · doi:10.1137/1020067 · Cited by 54
Cited by
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 743
Marchiori, M., & Latora, V. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00311-3 · Cited by 334
Guo, Z., & Wilson, N. H. M. (2011) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2010.11.002 · Cited by 281
A survey of resource constrained shortest path problems: Exact solution approaches
Pugliese, L. D. P., & Guerriero, F. (2013) · Networks · doi:10.1002/net.21511 · Cited by 147
Metadata
- Authors
- Gallo, G., & Pallottino, S.
- Venue
- Annals of Operations Research
- Published
- 1988-12
- Volume
- 13
- Issue
- 1
- Pages
- 1-79
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2061632451
- Cited by
- 352
- References
- 22
- FWCI
- 3.45
- 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.