The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Faster algorithms for the shortest path problem
Open accessAbstract
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap , is proposed for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C , a one-level form of radix heap gives a time bound for Dijkstra's algorithm of O ( m + n log C ). A two-level form of radix heap gives a bound of O ( m + n log C /log log C ). A combination of a radix heap and a previously known data structure called a Fibonacci heap gives a bound of O ( m + n a @@@@log C ). The best previously known bounds are O ( m + n log n ) using Fibonacci heaps alone and O ( m log log C ) using the priority queue structure of Van Emde Boas et al. [ 17].
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 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
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
Self-citationUniversal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
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
Self-citationEfficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
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
Amortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Self-citationDynamic Perfect Hashing: Upper and Lower Bounds
Dietzfelbinger, M., Karlin, A. R., Mehlhorn, K., der Heide, F. M. A., Rohnert, H., & Tarjan, R. E. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21968 · Cited by 421
Self-citationPreserving order in a forest in less than logarithmic time and linear space
van Emde Boas, P. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90031-x · Cited by 413
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
Tarjan, R. E., & Yao, A. C.-C. (1979) · Communications of the ACM · doi:10.1145/359168.359175 · Cited by 207
Self-citationShortest-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
Cited by
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
(1997) · Cited by 914
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 899
Fast and robust Earth Mover's Distances
Pele, O., & Werman, M. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459199 · Cited by 805
Advancing Neuromorphic Computing With Loihi: A Survey of Results and Outlook
Davies, M., Wild, A., Orchard, G., Sandamirskaya, Y., Guerra, G. A. F., Joshi, P., Plank, P., & Risbud, S. R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3067593 · Cited by 688
Metadata
- Authors
- Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E.
- Venue
- Journal of the ACM
- Published
- 1990-04
- Volume
- 37
- Issue
- 2
- Pages
- 213-223
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2160365857
- Cited by
- 554
- References
- 14
- FWCI
- 11.22
- 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.