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 条
  • [21] Vectorized algorithms for detecting the shortest paths in weighted directed graphs and their realization in vector supercomputers
    Kovalenko, N.S.
    Ovseets, M.I.
    Yaznevich, M.I.
    Programmirovanie, 1992, (01): : 65 - 71
  • [22] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    arXiv, 2020,
  • [23] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 153 - 166
  • [24] Massively parallel algorithms for fully dynamic all-pairs shortest paths
    Chilei Wang
    Qiang-Sheng Hua
    Hai Jin
    Chaodong Zheng
    Frontiers of Computer Science, 2024, 18
  • [25] Massively parallel algorithms for fully dynamic all-pairs shortest paths
    Wang, Chilei
    Hua, Qiang-Sheng
    Jin, Hai
    Zheng, Chaodong
    FRONTIERS OF COMPUTER SCIENCE, 2024, 18 (04)
  • [26] Temporal shortest paths: Parallel computing implementations
    Tremblay, N
    Florian, M
    PARALLEL COMPUTING, 2001, 27 (12) : 1569 - 1609
  • [27] Massively Parallel Algorithms for Approximate Shortest Paths
    Dory, Michal
    Matar, Shaked
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 415 - 426
  • [28] Replacement paths and k simple shortest paths in unweighted directed graphs
    Roditty, L
    Zwick, U
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 249 - 260
  • [29] Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
    Roditty, Liam
    Zwick, Uri
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [30] Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs
    Karczmarz, Adam
    Lacki, Jakub
    2020 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2020, : 106 - 120
12345