Journal
INFORMATION PROCESSING LETTERS
Volume 96, Issue 5, Pages 155-161Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2005.08.008
Keywords
graph algorithms; shortest path; divide and conquer
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
