Distributed almost exact approximations for minor-closed families

被引：0
|
作者：
Czygrinow, Andrzej [1 ]
Hanckowiak, Michal
机构：
[1] Arizona State Univ, Dept Math & Stat, Tempe, AZ 85287 USA
[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, Poznan, Poland
来源：
ALGORITHMS - ESA 2006, PROCEEDINGS | 2006年 / 4168卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give efficient deterministic distributed algorithms which given a graph G from a proper minor-closed family C find an approximation of a minimum dominating set in G and a minimum connected dominating set in G. The algorithms are deterministic and run in a polylogarithmic number of rounds. The approximation accomplished differs from an optimal by a multiplicative factor of (1 + o(1)).
引用
收藏
页码：244 / 255
页数：12
相关论文
共 50 条
  • [31] Random Graphs from a Minor-Closed Class
    McDiarmid, Colin
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (04): : 583 - 599
  • [32] Some minor-closed classes of signed graphs
    Slilaty, Daniel
    Zhou, Xiangqian
    [J]. DISCRETE MATHEMATICS, 2013, 313 (04) : 313 - 325
  • [33] Growth constants of minor-closed classes of graphs
    Bernardi, Olivier
    Noy, Marc
    Welsh, Dominic
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (05) : 468 - 484
  • [34] The Highly Connected Matroids in Minor-Closed Classes
    Geelen, Jim
    Gerards, Bert
    Whittle, Geoff
    [J]. ANNALS OF COMBINATORICS, 2015, 19 (01) : 107 - 123
  • [35] Every Minor-Closed Property of Sparse Graphs is Testable
    Benjamini, Itai
    Schramm, Oded
    Shapira, Asaf
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 393 - 402
  • [36] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Rautenbach, Dieter
    Redl, Johannes
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2191 - 2205
  • [37] Every minor-closed property of sparse graphs is testable
    Benjamini, Itai
    Schramm, Oded
    Shapira, Asaf
    [J]. ADVANCES IN MATHEMATICS, 2010, 223 (06) : 2200 - 2218
  • [38] Logical limit laws for minor-closed classes of graphs
    Heinig, Peter
    Muller, Tobias
    Noy, Marc
    Taraz, Anusch
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 130 : 158 - 206
  • [39] Layered separators in minor-closed graph classes with applications
    Dujmovic, Vida
    Morin, Pat
    Wood, David R.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 111 - 147
  • [40] MINOR-CLOSED GRAPH CLASSES WITH BOUNDED LAYERED PATHWIDTH
    Dujmovic, Vida
    Eppstein, David
    Joret, Gwenael
    Morin, Pat
    Wood, David R.
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (03) : 1693 - 1709
12345