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 >

AnO(n3(log?log?n/log?n)5/4) Time Algorithm for All Pairs Shortest Path

Author:
Yijie Han  


Journal:
Algorithmica


Issue Date:
2008


Abstract(summary):

We present an O(n 3 (log log n/ log n) 5/4) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n 3/log n) time.


Page:
428-434


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