DISTRIBUTED COMPUTATION ON GRAPHS - SHORTEST-PATH ALGORITHMS

被引：87
|
作者：
CHANDY, KM
MISRA, J
机构：
来源：
COMMUNICATIONS OF THE ACM | 1982年 / 25卷 / 11期
关键词：
D O I：
10.1145/358690.358717
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：833 / 837
页数：5
相关论文
共 50 条
  • [31] On variants of shortest-path betweenness centrality and their generic computation
    Brandes, Ulrik
    SOCIAL NETWORKS, 2008, 30 (02) : 136 - 145
  • [32] SHORTEST-PATH COMPUTATIONS IN SOURCE-DEPLANARIZED GRAPHS
    FREDERICKSON, GN
    HAMBRUSCH, SE
    TU, HY
    INFORMATION PROCESSING LETTERS, 1993, 47 (02) : 71 - 75
  • [33] A SINGLE SOURCE SHORTEST-PATH ALGORITHM FOR GRAPHS WITH SEPARATORS
    MEHLHORN, K
    SCHMIDT, BH
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 302 - 309
  • [34] SHORTEST-PATH RAY-TRACING WITH SPARSE GRAPHS
    FISCHER, R
    LEES, JM
    GEOPHYSICS, 1993, 58 (07) : 987 - 996
  • [35] Parallel algorithms for solving aggregated shortest-path problems
    Romeijn, HE
    Smith, RL
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (10-11) : 941 - 953
  • [36] Parametric Shortest-Path Algorithms via Tropical Geometry
    Joswig, Michael
    Schroter, Benjamin
    MATHEMATICS OF OPERATIONS RESEARCH, 2022, 47 (03) : 1 - 17
  • [37] NEW POLYNOMIAL SHORTEST-PATH ALGORITHMS AND THEIR COMPUTATIONAL ATTRIBUTES
    GLOVER, F
    KLINGMAN, DD
    PHILLIPS, NV
    SCHNEIDER, RF
    MANAGEMENT SCIENCE, 1985, 31 (09) : 1106 - 1128
  • [38] Engineering Label-Constrained Shortest-Path Algorithms
    Barrett, Chris
    Bisset, Keith
    Holzer, Martin
    Konjevod, Goran
    Marathe, Madhav
    Wagner, Dorothea
    SHORTEST PATH PROBLEM, 2009, 74 : 309 - +
  • [39] Engineering label-constrained shortest-path algorithms
    Barrett, Chris
    Bisset, Keith
    Holzer, Martin
    Konjevod, Goran
    Marathe, Madhav
    Wagner, Dorothea
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 27 - +
  • [40] Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs
    D'Emidio, Mattia
    ALGORITHMS, 2020, 13 (08)
12345