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

toTop

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

Turn on your phone and scan

home > search >

An O(n(3) log log n/log n) time algorithm for the all-pairs shortest path problem

Author:
Takaoka, T  


Journal:
INFORMATION PROCESSING LETTERS


Issue Date:
2005


Abstract(summary):

This paper achieves O(n(3) log log n/ log n) time for the all pairs shortest path problem on the conventional RAM model where only arithmetic operations, branching operations, and random accessibility with O(log n) bits are allowed. (c) 2005 Elsevier B.V. All rights reserved.


Page:
155---161


Similar Literature

Submit Feedback

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