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 条
[31]   Parallel asynchronous algorithms for the K shortest paths problem [J].
Guerriero, F ;
Musmanno, R .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 104 (01) :91-108
[32]   A fully dynamic approximation scheme for shortest paths in planar graphs [J].
Klein, PN ;
Subramanian, S .
ALGORITHMICA, 1998, 22 (03) :235-249
[33]   Oracles for Bounded-Length Shortest Paths in Planar Graphs [J].
Kowalik, Lukasz ;
Kurowski, Maciej .
ACM TRANSACTIONS ON ALGORITHMS, 2006, 2 (03) :335-363
[34]   A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs [J].
P. N. Klein ;
S. Subramanian .
Algorithmica, 1998, 22 :235-249
[35]   Fully dynamic approximation scheme for shortest paths in planar graphs [J].
Algorithmica (New York), 1998, 22 (03) :235-249
[36]   Faster shortest-path algorithms for planar graphs [J].
Henzinger, MR ;
Klein, P ;
Rao, S ;
Subramanian, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) :3-23
[37]   Parallel Shortest-Path Queries in Planar Graphs [J].
Aleksandrov, Lyudmil ;
Chapuis, Guillaume ;
Djidjev, Hristo .
PROCEEDINGS OF THE ACM WORKSHOP ON HIGH PERFORMANCE GRAPH PROCESSING (HPGP'16), 2016, :9-16
[38]   EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN PLANAR DIRECTED-GRAPHS [J].
LINGAS, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 :447-457
[39]   OPTIMAL PARALLEL ALGORITHMS ON PLANAR GRAPHS [J].
HAGERUP, T .
INFORMATION AND COMPUTATION, 1990, 84 (01) :71-96
[40]   OPTIMAL PARALLEL ALGORITHMS ON PLANAR GRAPHS [J].
HAGERUP, T .
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 :24-32
12345