The following publications are possibly variants of this publication:
- An ::::O:::: ( ::::n:::: :::3:::(log log ::::n:::: /log ::::n:::: ):::5/4:::) Time Algorithm for All Pairs Shortest PathYijie Han. algorithmica, 51(4):428-434, 2008. [doi]
- An ::::O::::(::::n:::::::3::: (loglog::::n::::/log::::n::::):::5/4:::) Time Algorithm for All Pairs Shortest PathsYijie Han. esa 2006: 411-417 [doi]
- An O(::::n:::::::3:::loglog::::n::::/log::::n::::) time algorithm for the all-pairs shortest path problemTadao Takaoka. ipl, 96(5):155-161, 2005. [doi]
- A note of an O(n:::3:::/logn) time algorithm for all pairs shortest pathsYijie Han. ipl, 105(3):114-116, 2008. [doi]
- Achieving O(n:::3:::/log n) Time for All Pairs Shortest Paths by Using a Smaller TableYijie Han. cata 2006: 36-37
- A Simpler Algorithm for the All Pairs Shortest Path Problem with ::::O::::(::::n:::::::2:::log::::n::::) Expected TimeTadao Takaoka, Mashitoh Hashim. cocoa 2010: 195-206 [doi]
- An All Pairs Shortest Path Algorithm with Expected Time O(n² log n)Alistair Moffat, Tadao Takaoka. SICOMP, 16(6):1023-1031, 1987.
- An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)Alistair Moffat, Tadao Takaoka. focs 1985: 101-105
- A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected timeTadao Takaoka. jco, 25(2):326-337, 2013. [doi]
- 2n) time algorithm for all pairs shortest pathsYijie Han, Tadao Takaoka. jda, 38:9-19, 2016. [doi]