Journal
INFORMATION PROCESSING LETTERS
Volume 91, Issue 5, Pages 245-250Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2004.05.006
Keywords
algorithms; complexity; graph algorithms; shortest path
Categories
Ask authors/readers for more resources
We present an improved algorithm for all pairs shortest paths. For a graph of n vertices our algorithm runs in O(n(3)(log log n/log n)(5/7)) time. This improves the best previous result which runs in O(n(3)(log log n/log n)(1/2)) time. (C) 2004 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
