Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic

被引:0
|
作者
Collette, Sébastien [1 ]
Iacono, John [2 ]
机构
[1] Synapsis Group, Belgium
[2] Université Libre de Bruxelles, Synapsis Group, Belgium
来源
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2024年 / 2024-January卷
关键词
Compendex;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:2657 / 2678
相关论文
共 38 条
  • [11] Replacement paths and k simple shortest paths in unweighted directed graphs
    Roditty, L
    Zwick, U
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 249 - 260
  • [12] Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
    Roditty, Liam
    Zwick, Uri
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [13] FAST ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS, WITH APPLICATIONS
    FREDERICKSON, GN
    SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1004 - 1022
  • [14] A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
    Feldmann, Andreas Emil
    Fung, Wai Shing
    Koenemann, Jochen
    Post, Ian
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 469 - 480
  • [15] A (1+ε)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS
    Feldmann, Andreas Emil
    Fung, Wai Shing
    Konemann, Jochen
    Post, Ian
    SIAM JOURNAL ON COMPUTING, 2018, 47 (04) : 1667 - 1704
  • [16] A SIMPLE AND FAST LABEL CORRECTING ALGORITHM FOR SHORTEST PATHS
    BERTSEKAS, DP
    NETWORKS, 1993, 23 (08) : 703 - 709
  • [17] Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs
    Karczmarz, Adam
    Lacki, Jakub
    2020 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2020, : 106 - 120
  • [19] A fully dynamic approximation scheme for shortest paths in planar graphs
    Klein, PN
    Subramanian, S
    ALGORITHMICA, 1998, 22 (03) : 235 - 249
  • [20] Dynamic Multi-level Overlay Graphs for Shortest Paths
    Bruera, Francesco
    Cicerone, Serafino
    D'Angelo, Gianlorenzo
    Di Stefano, Gabriele
    Frigioni, Daniele
    MATHEMATICS IN COMPUTER SCIENCE, 2008, 1 (04) : 709 - 736