Tadao Takaoka. Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 323-343, Springer, 1995.
@inproceedings{Takaoka95,
title = {Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem},
author = {Tadao Takaoka},
year = {1995},
researchr = {https://researchr.org/publication/Takaoka95},
cites = {0},
citedby = {0},
pages = {323-343},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings},
editor = {Manfred Nagl},
volume = {1017},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60618-1},
}