Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

13 mahmoudimus 2 5/29/2025, 3:43:19 AM arxiv.org ↗

Comments (2)

weebao · 2h ago
this'd be insane but how does it works?
djoldman · 20h ago
So for a directed graph with positive weights, this beats Dijkstra!? This would be an amazing result, right?

Or is this one of those Algorithms that is only meaningful with impractically small, large, or weird data?

No comments yet