Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
93 points
1 day ago
| 2 comments
| arxiv.org
| HN
▲
random3
1 day ago
[-]
This was active a couple of days ago https://news.ycombinator.com/item?id=44812695
reply
▲
gsliepen
1 day 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.
reply
▲
MarkusQ
1 day ago
[-]
Degree less than 6? If m < 3n that means there are three times as many edges as nodes, and each edge connect to two vertices.

So 2d square latices would still benefit.

But yeah, not a total domination.

reply