Modern Orange
Open main menu
New
Best
Ask
Show
Jobs
About
A
Story
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
76
2
pentestercrab
9 hours ago
arxiv.org
random3
·
8 hours ago
·
[ - ]
This was active a couple of days ago
https://news.ycombinator.com/item?id=44812695
gsliepen
·
2 hours ago
·
[ - ]
At first glance it looks like this is very useful, but it only gives a speedup for very sparse graphs with an average degree of less than 3, unless your graph is very big, as in trillions of vertices.