On the all-pairs shortest-path algorithm of Moffat and Takaoka

被引：0
|
作者：
Mehlhorn, K [1 ]
Priebe, V [1 ]
机构：
[1] MAX PLANCK INST INFORMAT,D-66123 SAARBRUCKEN,GERMANY
来源：
RANDOM STRUCTURES & ALGORITHMS | 1997年 / 10卷 / 1-2期
关键词：
shortest-path problems; probabilistic analysis; tail estimates; lower bound;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We review how to solve the all-pairs shortest-path problem in a nonnegatively weighted digraph with n vertices in expected time O(n(2) log n). This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted digraphs. We also prove that, for a large class of probability distributions, Ohm(n log n) time is necessary with high probability to compute shortest-path distances with respect to a single source. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：205 / 220
页数：16
相关论文
共 50 条
12345