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

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Subcubic Cost Algorithms for the All Pairs Shortest Path ProblemTadao Takaoka. algorithmica, 20(3):309-318, 1998.

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path ProblemTadao Takaoka. criwg 1995: 323-343

An Efficient Parallel Algorithm for the All Pairs Shortest Path ProblemTadao Takaoka. criwg 1989: 276-287

runs on WebDSL