A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

Tadao Takaoka. A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. In Kyung-Yong Chwa, J. Ian Munro, editors, Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings. Volume 3106 of Lecture Notes in Computer Science, pages 278-289, Springer, 2004. [doi]

@inproceedings{Takaoka04,
  title = {A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application},
  author = {Tadao Takaoka},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3106&spage=278},
  researchr = {https://researchr.org/publication/Takaoka04},
  cites = {0},
  citedby = {0},
  pages = {278-289},
  booktitle = {Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
  editor = {Kyung-Yong Chwa and J. Ian Munro},
  volume = {3106},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22856-X},
}