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 条
  • [1] Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
    Kawarabayashi, Ken-ichi
    Klein, Philip N.
    Sommer, Christian
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 135 - 146
  • [2] Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
    Wulff-Nilsen, Christian
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 1063 - 1074
  • [3] Packing cycles in planar and bounded-genus graphs
    Schlomberg, Niklas
    Thiele, Hanjo
    Vygen, Jens
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2069 - 2086
  • [4] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    Éric Colin de Verdière
    Algorithmica, 2017, 78 : 1206 - 1224
  • [5] Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
    Demaine, ED
    Fomin, FV
    Hajiaghayi, M
    Thilikos, DM
    JOURNAL OF THE ACM, 2005, 52 (06) : 866 - 893
  • [6] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    de Verdiere, Eric Colin
    ALGORITHMICA, 2017, 78 (04) : 1206 - 1224
  • [7] BOUNDED ORACLES AND COMPLEXITY CLASSES INSIDE LINEAR-SPACE
    TRETKOFF, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 223 : 347 - 361
  • [8] Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
    de Verdiere, Eric Colin
    ALGORITHMS - ESA 2015, 2015, 9294 : 373 - 385
  • [9] Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Sankowski, Piotr
    van Leeuwen, Erik Jan
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 276 - 285
  • [10] Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Sankowski, Piotr
    Van Leeuwen, Erik Jan
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (04)
123