Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
1–4 of 4 posts
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#2This was active a couple of days ago https://news.ycombinator.com/item?id=44812695
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#3At 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.
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#4At 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.
Degree less than 6? If m So 2d square latices would still benefit.
But yeah, not a total domination.