Journal article · 2026 · Open access

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin

Journal of the ACM · Published 1 October 2026 · DOI 10.1145/3849867

Open full textCite this paper

In brief

“Breaking the Sorting Barrier for Directed Single-Source Shortest Paths” is a 2026 journal article by Ran Duan and 4 co-authors, published in Journal of the ACM. OpenAlex counts 11 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of the ACM.

Citations
11
Most cited in
2026 (9)
Field-weighted impact
21.36
References
44
Authors
5

Abstract

We give a deterministic O ( m log 2/3 n )-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is the first result to break the O ( m + n log n ) time bound of Dijkstra’s algorithm on sparse graphs, showing that Dijkstra’s algorithm is not optimal for SSSP.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Duan, R., Mao, J., Mao, X., Shu, X., & Yin, L. (2026). Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. Journal of the ACM. https://doi.org/10.1145/3849867

MLA 9

Duan, Ran, et al. “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths.” Journal of the ACM, 2026. https://doi.org/10.1145/3849867.

Chicago

Duan, Ran, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin. 2026. “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths.” Journal of the ACM. https://doi.org/10.1145/3849867.

Harvard

Duan, R. et al. (2026) ‘Breaking the Sorting Barrier for Directed Single-Source Shortest Paths’, Journal of the ACM. doi:10.1145/3849867.

IEEE

R. Duan, J. Mao, X. Mao, X. Shu, and L. Yin, “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths,” Journal of the ACM, 2026, doi: 10.1145/3849867.

BibTeX

@article{duan2026breaking,
  title     = {{Breaking the Sorting Barrier for Directed Single-Source Shortest Paths}},
  author    = {Duan, Ran and Mao, Jiayi and Mao, Xiao and Shu, Xinkai and Yin, Longhui},
  journal   = {Journal of the ACM},
  year      = {2026},
  doi       = {10.1145/3849867},
  url       = {https://doi.org/10.1145/3849867}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202411
202511
202699

Its field-weighted citation impact is 21.36: it has been cited 21.36 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs

  • single-source shortest path
  • directed graphs
  • Dijkstra's algorithm
  • sparse graphs
  • deterministic algorithms
  • time complexity
  • non-negative edge weights

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Duan, R., Mao, J., Mao, X., Shu, X., & Yin, L. (2026). Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. Journal of the ACM. https://doi.org/10.1145/3849867

How many times has this paper been cited?

11 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Journal of the ACM: sign in and open the full text from this page.

Who wrote this paper?

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin.

What is the DOI of this paper?

10.1145/3849867, permanently at https://doi.org/10.1145/3849867. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.