Yijie Han, Tadao Takaoka. An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. In Fedor V. Fomin, Petteri Kaski, editors, Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Volume 7357 of Lecture Notes in Computer Science, pages 131-141, Springer, 2012. [doi]
@inproceedings{HanT12, title = {An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths}, author = {Yijie Han and Tadao Takaoka}, year = {2012}, doi = {10.1007/978-3-642-31155-0_12}, url = {http://dx.doi.org/10.1007/978-3-642-31155-0_12}, researchr = {https://researchr.org/publication/HanT12}, cites = {0}, citedby = {0}, pages = {131-141}, booktitle = {Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings}, editor = {Fedor V. Fomin and Petteri Kaski}, volume = {7357}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-31154-3}, }