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 条

[1] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Han, YJ
Pan, VY
Reif, JH
ALGORITHMICA, 1997, 17 (04) : 399 - 415
[2] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Yijie Han
V. Y. Pan
J. H. Reif
Algorithmica, 1997, 17 : 399 - 415
[3] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Algorithmica (New York), 4 (399):
[4] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
PANTZIOU, GE
SPIRAKIS, PG
ZAROLIAGIS, CD
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
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
DISCRETE APPLIED MATHEMATICS, 2023, 341 : 102 - 119
[7] Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
Kratsch, Stefan
Nelles, Florian
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
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
ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 173 - 182
[10] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR DIGRAPHS
PANTZIOU, GE
SPIRAKIS, PG
ZAROLIAGIS, CD
BIT, 1992, 32 (02): : 215 - 236

← 1 2 3 4 5 →