Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

Posted by mahmoudimus on Wednesday May 28, 2025 @11:43PM
from the arxiv.org dept.

( 2 comments | on HN )

Re:Breaking the Sorting Barrier for Directed Single-Source S... by djoldman on Thursday May 29, 2025 @07:06AM (#44124824)

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?

[ Parent | on HN ]

Re:Breaking the Sorting Barrier for Directed Single-Source S... by weebao on Friday May 30, 2025 @01:35AM (#44133224)

this'd be insane but how does it works?

[ Parent | on HN ]