A note of an O(n:::3:::/logn) time algorithm for all pairs shortest paths

Yijie Han. A note of an O(n:::3:::/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett., 105(3):114-116, 2008. [doi]

@article{Han08:13,
  title = {A note of an O(n:::3:::/logn) time algorithm for all pairs shortest paths},
  author = {Yijie Han},
  year = {2008},
  doi = {10.1016/j.ipl.2007.08.015},
  url = {http://dx.doi.org/10.1016/j.ipl.2007.08.015},
  researchr = {https://researchr.org/publication/Han08%3A13},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {105},
  number = {3},
  pages = {114-116},
}