SHORTEST PATH ALGORITHM FOR EDGE-SPARSE GRAPHS

被引：26
|
作者：
WAGNER, RA [1 ]
机构：
[1] VANDERBILT UNIV, DEPT SYST & INFORMATION SCI, POB 6147, STN B, NASHVILLE, TN 37203 USA
来源：
JOURNAL OF THE ACM | 1976年 / 23卷 / 01期
关键词：
D O I：
10.1145/321921.321927
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：50 / 57
页数：8
相关论文
共 50 条
  • [1] SHORTEST PATH ALGORITHM FOR GRID GRAPHS
    HADLOCK, FO
    NETWORKS, 1977, 7 (04) : 323 - 334
  • [2] A SHORTEST-PATH ALGORITHM FOR MANHATTAN GRAPHS
    KANCHANASUT, K
    INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 21 - 25
  • [3] A faster all-pairs shortest path algorithm for real-weighted sparse graphs
    Pettie, S
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 85 - 97
  • [4] SHORTEST-PATH RAY-TRACING WITH SPARSE GRAPHS
    FISCHER, R
    LEES, JM
    GEOPHYSICS, 1993, 58 (07) : 987 - 996
  • [5] Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
    Bodwin, Greg
    Parter, Merav
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 435 - 443
  • [6] Shortest path algorithm for graphs in instances of semantic optimization
    Lavlinskaya, O. Yu
    Kurchenkova, T., V
    Kuripta, O., V
    APPLIED MATHEMATICS, COMPUTATIONAL SCIENCE AND MECHANICS: CURRENT PROBLEMS, 2020, 1479
  • [7] An All Pairs Shortest Path Algorithm for Dynamic Graphs
    Alshammari, Muteb
    Rezgui, Abdelmounaam
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2020, 15 (01): : 347 - 365
  • [8] Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
    Bodwin, Greg
    Parter, Merav
    JOURNAL OF THE ACM, 2023, 70 (05)
  • [9] A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths
    Allulli, Luca
    Lichodzijewski, Peter
    Zeh, Norbert
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 910 - 919
  • [10] An improved Dijkstra's shortest path algorithm for sparse network
    Xu, M. H.
    Liu, Y. Q.
    Huang, Q. L.
    Zhang, Y. X.
    Luan, G. F.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (01) : 247 - 254
12345