9 citations · 17 across the 4 of their papers we have counts for
1 paper · 1 filter
Stefan Kratsch, Florian Nelles
Computing all-pairs shortest paths is a fundamental and much-studied problem with many applications. Unfortunately, despite intense study, there are still no significantly faster a…