Breaking the Sorting Barrier for Directed Single-Source Shortest Paths · HackerPapers discussions

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by danalec

Mon, 23 Feb 2026 16:14:10 GMT

I implemented the STOC 2025 Best Paper Award winner in C99. The algorithm achieves O(m log^(2/3) n) complexity, breaking the 65-year-old sorting barrier for sparse directed SSSP that Dijkstra established at O(m + n log n). *Key implementation details:* - Cache-optimized CSR layout for maximum spatial locality - Zero-allocation design with pre-allocated workspaces - Recursive subproblem decomposition instead of global priority queues *Benchmarks:* On graphs with 250k–1M nodes, this shows 20,000x+ speedups over standard Dijkstra implementations. The DMMSY core runs in ~800ns for 1M nodes.…

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by fn-mote

Fri, 13 Feb 2026 19:40:57 GMT

Should have a more conspicuous link to the Quanta article that it references if not the original. (It’s there, just not on the top.) https://www.quantamagazine.org/new-method-is-the-fastest-way... https://arxiv.org/abs/2504.17033

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by Jtsummers

Fri, 13 Feb 2026 19:21:48 GMT

> What I'm missing is certainly what the hell the algorithm even is and what is its complexity. https://arxiv.org/pdf/2504.17033 - Linked from the second sentence of the submission, not hard to track down. And the complexity (by which I presume you mean algorithmic complexity) is stated in the submission and in the PDF linked by the submission and that I just shared with you.

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by CMay

Sun, 12 Oct 2025 13:24:07 GMT

In the article it does talk about how they arrived at a partial solution that only worked on undirected graphs, but then they started taking a hybrid approach to get it to work on directed graphs. The paper also indicates it works on directed graphs: https://arxiv.org/abs/2504.17033 That said, it might only be faster for large, sparse graphs.

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by demarq

Sun, 12 Oct 2025 11:50:44 GMT

Here is the paper https://arxiv.org/abs/2504.17033

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by robaato

Fri, 03 Oct 2025 12:23:13 GMT

Original paper: https://arxiv.org/abs/2504.17033

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Sat, 09 Aug 2025 05:34:09 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

99 points; 3 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by supernetworks_

Wed, 06 Aug 2025 16:29:45 GMT

https://arxiv.org/abs/2504.17033 We give a deterministic O(mlog2/3n)-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+nlogn) time bound of Dijkstra's algorithm on sparse graphs, showing that Dijkstra's algorithm is not optimal for SSSP.

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Wed, 06 Aug 2025 14:43:02 GMT

Breaking the sorting barrier for directed single-source shortest paths

https://arxiv.org/abs/2504.17033

194 points; 51 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Thu, 19 Jun 2025 16:43:34 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Mon, 09 Jun 2025 16:23:00 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Sat, 07 Jun 2025 22:33:39 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — mentioned by belter

Sat, 07 Jun 2025 14:29:35 GMT

https://arxiv.org/abs/2504.17033

Paper and discussion history. A mention is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Tue, 03 Jun 2025 13:42:26 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Sun, 01 Jun 2025 21:18:31 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths [pdf]

2 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Fri, 30 May 2025 12:04:43 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Thu, 29 May 2025 03:43:19 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

17 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Wed, 28 May 2025 15:11:06 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Mon, 19 May 2025 17:31:21 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths — HN submission

Sun, 18 May 2025 18:29:10 GMT

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.