Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1

被引：0
作者：
Han, Yijie
Pan, V.Y.
Reif, J.H.
机构：
[1] Department of Computer Science, University of Kentucky, Lexington, KY 40506, United States
[2] Dept. of Math. and Computer Science, Lehman College, CUNY, Bronx, NY 10468, United States
[3] Department of Computer Science, Duke University, Durham, NC 27706, United States
[4] Electronic Data Systems, Inc., Mail Stop 408, 300 E. Big Beaver Road, Troy, MI 48083, United States
来源：
Algorithmica (New York) | 1997年 / 17卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：399 / 415
相关论文
共 50 条
[21]   Vectorized algorithms for detecting the shortest paths in weighted directed graphs and their realization in vector supercomputers [J].
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 [J].
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
[23]   New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs [J].
Gutenberg, Maximilian Probst ;
Williams, Virginia Vassilevska ;
Wein, Nicole .
arXiv, 2020,
[24]   Massively parallel algorithms for fully dynamic all-pairs shortest paths [J].
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 [J].
Wang, Chilei ;
Hua, Qiang-Sheng ;
Jin, Hai ;
Zheng, Chaodong .
FRONTIERS OF COMPUTER SCIENCE, 2024, 18 (04)
[26]   Temporal shortest paths: Parallel computing implementations [J].
Tremblay, N ;
Florian, M .
PARALLEL COMPUTING, 2001, 27 (12) :1569-1609
[27]   Massively Parallel Algorithms for Approximate Shortest Paths [J].
Dory, Michal ;
Matar, Shaked .
PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, :415-426
[28]   Shortest paths on a polyhedron .1. Computing shortest paths [J].
Chen, JD ;
Han, YJ .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) :127-144
[29]   Massively parallel algorithms for approximate shortest paths [J].
Michal Dory ;
Shaked Matar .
Distributed Computing, 2025, 38 (2) :131-162
[30]   Replacement paths and k simple shortest paths in unweighted directed graphs [J].
Roditty, L ;
Zwick, U .
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 :249-260
12345