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 条
  • [21] Efficient parallel algorithms for planar st-graphs
    Atallah, MJ
    Chen, DZ
    Daescu, O
    ALGORITHMICA, 2003, 35 (03) : 194 - 215
  • [22] Efficient parallel algorithms for planar st-graphs
    Atallah, MJ
    Chen, DZ
    Daescu, O
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 223 - 232
  • [23] An efficient parallel algorithm for shortest paths in planar layered digraphs附视频
    MISHRA P.K.
    Journal of Zhejiang University Science, 2004, (05) : 21 - 30
  • [24] Massively parallel algorithms for approximate shortest paths
    Michal Dory
    Shaked Matar
    Distributed Computing, 2025, 38 (2) : 131 - 162
  • [25] Massively Parallel Algorithms for Approximate Shortest Paths
    Dory, Michal
    Matar, Shaked
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 415 - 426
  • [26] Maximum Flows and Parametric Shortest Paths in Planar Graphs
    Erickson, Jeff
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 794 - 804
  • [27] Multiple-source shortest paths in planar graphs
    Klein, Philip N.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 146 - 155
  • [28] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS
    JOHNSON, DB
    JOURNAL OF THE ACM, 1977, 24 (01) : 1 - 13
  • [29] Efficient Parallel Shortest Path Algorithms
    Alves, David R.
    Krishnakumar, Madan S.
    Garg, Vijay K.
    2020 19TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING (ISPDC 2020), 2020, : 188 - 195
  • [30] Parallel Asynchronous Algorithms for the K Shortest Paths Problem
    F. Guerriero
    R. Musmanno
    Journal of Optimization Theory and Applications, 2000, 104 : 91 - 108
12345