The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Finding the k Shortest Paths
Abstract
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n + kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
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
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
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
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
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Suurballe, J. W. (1974) · Networks · doi:10.1002/net.3230040204 · Cited by 685
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
Lawler, E. L. (1972) · Management Science · doi:10.1287/mnsc.18.7.401 · Cited by 431
An algorithm for the ranking of shortest paths
de Azevedo, J., Costa, M. E. O. S., Madeira, J. J. E. R. S., & Martins, E. Q. V. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90095-5 · Cited by 225
An algorithm for ranking paths that may contain cycles
Martins, E. D. Q. V. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90269-8 · Cited by 92
Cited by
Fu, Y., Ding, M., & Zhou, C. (2012) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2159586 · Cited by 256
Resource Constrained Shortest Paths
Mehlhorn, K., & Ziegelmann, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45253-2_30 · Cited by 124
Models of settlement hierarchy based on partial evidence
Bevan, A., & Wilson, A. (2013) · Journal of Archaeological Science · doi:10.1016/j.jas.2012.12.025 · Cited by 87
Estimating multi-year 24 / 7 origin-destination demand using high-granular multi-source traffic data
Ma, W., & Qian, Z. (. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.09.002 · Cited by 56
A data transmission scheduling algorithm for rapid-response earth-observing operations
Li, J., Li, J., Chen, H., & Jing, N. (2014) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2014.02.014 · Cited by 34
Metadata
- Authors
- Eppstein, D.
- Venue
- SIAM Journal on Computing
- Published
- 1998-01
- Volume
- 28
- Issue
- 2
- Pages
- 652-673
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2131058166
- Cited by
- 1,381
- References
- 11
- FWCI
- 11.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Finding the k Shortest Paths. https://app.cochat.ai/papers/10.1137/s0097539795290477
- The paper
- Eppstein, D. (1998). Finding the k Shortest Paths. SIAM Journal on Computing. https://doi.org/10.1137/s0097539795290477
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.
