Efficient parallel algorithms for computing all pair shortest paths in directed graphs

被引：23
|
作者：
Han, YJ
Pan, VY
Reif, JH
机构：
[1] UNIV KENTUCKY,DEPT COMP SCI,LEXINGTON,KY 40506
[2] CUNY HERBERT H LEHMAN COLL,DEPT MATH & COMP SCI,BRONX,NY 10468
[3] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706
来源：
ALGORITHMICA | 1997年 / 17卷 / 04期
关键词：
analysis of algorithms; design of algorithms; parallel algorithms; graph algorithms; shortest path;
D O I：
10.1007/BF02523680
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present parallel algorithms for computing all pair shortest paths in directed graphs. Our algorithm has time complexity O(f(n)/p + I(n)log n) on the PRAM using p processors, where I(n) is log n on the EREW PRAM, log log n on the CCRW PRAM, f(n) is o(n(3)). On the randomized CRCW PRAM we are able to achieve time complexity O (n(3)/p + log n) using p processors.
引用
收藏
页码：399 / 415
页数：17
相关论文
共 50 条
12345