| ▲ | Breaking the Sorting Barrier for Directed Single-Source Shortest Paths(arxiv.org) | |||||||
| 96 points by pentestercrab 5 days ago | 3 comments | ||||||||
| ▲ | random3 5 days ago | parent | next [-] | |||||||
This was active a couple of days ago https://news.ycombinator.com/item?id=44812695 | ||||||||
| ▲ | gsliepen 5 days ago | parent | prev [-] | |||||||
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. | ||||||||
| ||||||||