期刊
INFORMATION PROCESSING LETTERS
卷 91, 期 5, 页码 245-250出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2004.05.006
关键词
algorithms; complexity; graph algorithms; shortest path
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
