Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs

被引：0
|
作者：
Kawarabayashi, Ken-Ichi [1 ]
Klein, Philip N. [2 ]
Sommer, Christian [3 ]
机构：
[1] NII, Tokyo, Japan
[2] Brown U, Providence, RI, United States
[3] MIT, Cambridge, MA, United States
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011年 / 6755 LNCS卷 / PART 1期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
页码：135 / 146
相关论文
共 26 条
  • [21] Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
    Lu, HI
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 223 - 224
  • [22] Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
    Ducoffe, Guillaume
    Habib, Michel
    Viennot, Laurent
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1905 - 1922
  • [23] Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
    Ducoffe, Guillaume
    Habib, Michel
    Viennot, Laurent
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1905 - 1922
  • [24] DIAMETER, ECCENTRICITIES AND DISTANCE ORACLE COMPUTATIONS ON H-MINOR FREE GRAPHS AND GRAPHS OF BOUNDED (DISTANCE) VAPNIK-CHERVONENKIS DIMENSION
    Ducoffe, Guillaume
    Habib, Michel
    Viennot, Laurent
    SIAM JOURNAL ON COMPUTING, 2022, 51 (05) : 1506 - 1534
  • [25] Shortest Paths in Directed Planar Graphs with Negative Lengths: A Linear-Space O(n log2 n)-Time Algorithm
    Klein, Philip N.
    Mozes, Shay
    Weimann, Oren
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [26] Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2 n)-Time Algorithm
    Klein, Philip
    Mozes, Shay
    Weimann, Oren
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 236 - +
123