Tadao Takaoka. An O(::::n:::::::3:::loglog::::n::::/log::::n::::) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett., 96(5):155-161, 2005. [doi]
@article{Takaoka05,
title = {An O(::::n:::::::3:::loglog::::n::::/log::::n::::) time algorithm for the all-pairs shortest path problem},
author = {Tadao Takaoka},
year = {2005},
doi = {10.1016/j.ipl.2005.08.008},
url = {http://dx.doi.org/10.1016/j.ipl.2005.08.008},
researchr = {https://researchr.org/publication/Takaoka05},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {96},
number = {5},
pages = {155-161},
}