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

← 1 2 3 4 5 →