A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time

Tadao Takaoka. A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. J. Comb. Optim., 25(2):326-337, 2013. [doi]

No reviews for this publication, yet.