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 条
  • [1] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
    Yijie Han
    V. Y. Pan
    J. H. Reif
    [J]. Algorithmica, 1997, 17 : 399 - 415
  • [2] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
    [J]. Algorithmica (New York), 4 (399):
  • [3] Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1
    Han, Yijie
    Pan, V.Y.
    Reif, J.H.
    [J]. Algorithmica (New York), 1997, 17 (04): : 399 - 415
  • [4] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 288 - 300
  • [5] Logspace algorithms for computing shortest and longest paths in series-parallel graphs
    Jakoby, Andreas
    Tantau, Till
    [J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 216 - 227
  • [6] Efficient parameterized algorithms for computing all-pairs shortest paths
    Kratsch, Stefan
    Nelles, Florian
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 341 : 102 - 119
  • [7] Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
    Kratsch, Stefan
    Nelles, Florian
    [J]. 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [8] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
    Zwick, U
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
  • [9] Parallel algorithms for shortest paths and related problems on trapezoid graphs
    Hsu, FR
    Lin, YL
    Tsai, YT
    [J]. ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 173 - 182
  • [10] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR DIGRAPHS
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    [J]. BIT, 1992, 32 (02): : 215 - 236
12345