173 citations · 305 across the 14 of their papers we have counts for
1 paper · 1 filter
Julian J. McAuley, Tibério S. Caetano
It has been shown by Alon et al. that the so-called 'all-pairs shortest-path' problem can be solved in O((MV)^2.688 * log^3(V)) for graphs with V vertices, with integer distances b…