Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A note of an O(n(3)/log n) time algorithm for all pairs shortest paths

Author:
Han, Yijie  


Journal:
INFORMATION PROCESSING LETTERS


Issue Date:
2008


Abstract(summary):

We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n(3)/log n). Our improvement is achieved by using a smaller table and therefore saves time for the algorithm. (C) 2007 Elsevier B.V. All rights reserved.


Page:
114---116


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads