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 条
[41]   Practical mesh algorithms for finding shortest paths in grid graphs [J].
Shi, HC ;
Gader, P .
INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, :725-731
[42]   EFFICIENT PARALLEL ALGORITHMS OF GRAPHS [J].
DJIDJEV, HN .
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1985, 38 (06) :687-689
[43]   Efficient labeling algorithms for adjacent quadratic shortest paths [J].
Vilela, João ;
Fanzeres, Bruno ;
Martinelli, Rafael ;
Contardo, Claudio .
arXiv, 2021,
[44]   Highway Dimension, Shortest Paths, and Provably Efficient, Algorithms [J].
Abraham, Ittai ;
Fiat, Amos ;
Goldberg, Andrew V. ;
Werneck, Renato F. .
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 :782-793
[45]   Partially dynamic efficient algorithms for distributed shortest paths [J].
Cicerone, Serafino ;
D'Angelo, Gianlorenzo ;
Di Stefano, Gabriele ;
Frigioni, Daniele .
THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) :1013-1037
[46]   Linear-Time Algorithms for Max Flow and Multiple -Source Shortest Paths in Unit -Weight Planar Graphs [J].
Eisenstat, David ;
Klein, Philip N. .
STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, :735-744
[47]   MINIMUM CUTS AND SHORTEST CYCLES IN DIRECTED PLANAR. GRAPHS VIA NONCROSSING SHORTEST PATHS [J].
Liang, Hung-Chun ;
Lu, Hsueh-I .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) :454-476
[48]   EFFICIENT PARALLEL AND SEQUENTIAL ALGORITHMS FOR 4-COLORING PERFECT PLANAR GRAPHS [J].
XIN, H .
ALGORITHMICA, 1990, 5 (04) :545-559
[49]   An efficient algorithm to determine all shortest paths in Sierpinski graphs [J].
Hinz, Andreas M. ;
auf der Heide, Caroline Holz .
DISCRETE APPLIED MATHEMATICS, 2014, 177 :111-120
[50]   Efficient Shortest Paths on Massive Social Graphs (Invited Paper) [J].
Zhao, Xiaohan ;
Sala, Alessandra ;
Zheng, Haitao ;
Zhao, Ben Y. .
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING (COLLABORATECOM), 2011, :77-86
12345