A note of an O(n3/logn) time algorithm for all pairs shortest paths

A note of an O(n3/logn) time algorithm for all pairs shortest paths

0.00 Avg rating—0 Votes
Article ID: iaor2009628
Country: Netherlands
Volume: 105
Issue: 3
Start Page Number: 114
End Page Number: 116
Publication Date: Jan 2008
Journal: Information Processing Letters
Authors:
Abstract:

We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n3/logn). Our improvement is achieved by using a smaller table and therefore saves time for the algorithm.

Reviews

Required fields are marked *. Your email address will not be published.