The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Shortest‐path algorithms: Taxonomy and annotation
Abstract
We have evolved a classification scheme to characterize algorithms for solving shortestpath problems. The algorithms are classified according to (A) the problem type, i.e., the question being asked about the given network; (B) the input type, i.e., the salient features of the given network which impact on the design of the algorithm and selection of data structures; and (C) the type of underlying technique employed to solve the problem. An annotated bibliography of 79 selected references on shortest‐path algorithms is included. We have also provided a more complete listing of 222 references carefully culled out of a larger body of literature on shortest‐path algorithms through the year 1979.
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 24,043
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Finding the K Shortest Loopless Paths in a Network
Yen, J. Y. (1971) · Management Science · doi:10.1287/mnsc.17.11.712 · Cited by 2,618
An Algorithm for Path Connections and Its Applications
Lee, C. Y. (1961) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1961.5219222 · Cited by 1,619
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
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Cited by
The image foresting transform: theory, algorithms, and applications
Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261076 · Cited by 614
A roadmap for traffic engineering in SDN-OpenFlow networks
Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Orda, A., & Rom, R. (1990) · Journal of the ACM · doi:10.1145/79147.214078 · Cited by 483
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
An ultra-fast user-steered image segmentation paradigm: live wire on the fly
Falcao, A. X., Udupa, J. K., & Miyazawa, F. K. (2000) · IEEE Transactions on Medical Imaging · doi:10.1109/42.832960 · Cited by 275
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
Metadata
- Authors
- Deo, N., & Pang, C.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1984-06
- Volume
- 14
- Issue
- 2
- Pages
- 275-323
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2063317962
- Cited by
- 309
- References
- 38
- FWCI
- 4.55
- 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.