EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS

被引：0

|

作者：

PANTZIOU, GE

SPIRAKIS, PG

ZAROLIAGIS, CD

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 447卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：288 / 300

页数：13

相关论文

共 50 条

[1] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR DIGRAPHS
PANTZIOU, GE
SPIRAKIS, PG
ZAROLIAGIS, CD
BIT, 1992, 32 (02): : 215 - 236
[2] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
FEUERSTEIN, E
MARCHETTISPACCAMELA, A
THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 359 - 371
[3] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
FEUERSTEIN, E
MARCHETTISPACCAMELA, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 187 - 197
[4] FAST ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS, WITH APPLICATIONS
FREDERICKSON, GN
SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1004 - 1022
[5] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Han, YJ
Pan, VY
Reif, JH
ALGORITHMICA, 1997, 17 (04) : 399 - 415
[6] 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
[7] Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Algorithmica (New York), 4 (399):
[8] An efficient oracle for counting shortest paths in planar graphs
Gong, Ye
Gu, Qian-Ping
THEORETICAL COMPUTER SCIENCE, 2022, 921 : 75 - 85
[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 Computing All Pair Shortest Paths in Directed Graphs1
Han, Yijie
Pan, V.Y.
Reif, J.H.
Algorithmica (New York), 1997, 17 (04): : 399 - 415

← 1 2 3 4 5 →