The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Efficient Algorithms for Shortest Paths in Sparse Networks
Open accessAbstract
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs. Known results which the results of this paper extend are surveyed briefly and analyzed. A new implementation for priority queues is employed, and a class of “arc set partition” algorithms is introduced. For the single source problem on networks with nonnegative arcs a running time of O (min( n 1+1/ k + e , n + e ) log n )) is achieved, where there are n nodes and e arcs, and k is a fixed integer satisfying k > 0. This bound is O ( e ) on dense networks. For the single source and all pairs problem on unrestricted networks the running time is O (min( n 2+1/ k + ne , n 2 log n + ne log n ).
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
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
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
Yen, J. Y. (1970) · Quarterly of Applied Mathematics · doi:10.1090/qam/253822 · Cited by 424
A Note on Dijkstra's Shortest Path Algorithm
Johnson, D. B. (1973) · Journal of the ACM · doi:10.1145/321765.321768 · Cited by 380
Self-citationReview of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
Cited by
Pires, D. E. V., Blundell, T. L., & Ascher, D. B. (2015) · Journal of Medicinal Chemistry · doi:10.1021/acs.jmedchem.5b00104 · Cited by 5,716
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 3,132
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Saliency Optimization from Robust Background Detection
Zhu, W., Liang, S., Wei, Y., & Sun, J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.360 · Cited by 1,330
Identifying influential nodes in complex networks
Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., & Zhou, T. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.09.017 · Cited by 1,210
Metadata
- Authors
- Johnson, D. B.
- Venue
- Journal of the ACM
- Published
- 1977-01
- Volume
- 24
- Issue
- 1
- Pages
- 1-13
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2022980325
- Cited by
- 1,041
- References
- 13
- FWCI
- 10.01
- Type
- journal article
- Language
- en
- Open access
- bronze
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.