A new upper bound on the complexity of the all pairs shortest path problem (1992)

by T Takaoka
Venue:Information Processing Letters (IPL