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]

@article{Takaoka13,
  title = {A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time},
  author = {Tadao Takaoka},
  year = {2013},
  doi = {10.1007/s10878-012-9550-3},
  url = {http://dx.doi.org/10.1007/s10878-012-9550-3},
  researchr = {https://researchr.org/publication/Takaoka13},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {25},
  number = {2},
  pages = {326-337},
}