Article ID Journal Published Year Pages File Type
10331927 Information Processing Letters 2005 7 Pages PDF
Abstract
This paper achieves O(n3loglogn/logn) time for the all pairs shortest path problem on the conventional RAM model where only arithmetic operations, branching operations, and random accessibility with O(logn) bits are allowed.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Authors
,