Tadao Takaoka. A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. In Gunther Schmidt, Rudolf Berghammer, editors, 17th International Workshop, WG 91, Fischbachau, Germany, June 17-19, 1991, Proceedings. Volume 570 of Lecture Notes in Computer Science, pages 209-213, Springer, 1991.
@inproceedings{Takaoka91,
title = {A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem},
author = {Tadao Takaoka},
year = {1991},
researchr = {https://researchr.org/publication/Takaoka91},
cites = {0},
citedby = {0},
pages = {209-213},
booktitle = {17th International Workshop, WG 91, Fischbachau, Germany, June 17-19, 1991, Proceedings},
editor = {Gunther Schmidt and Rudolf Berghammer},
volume = {570},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-55121-2},
}