On distance r-dominating and 2r-independent sets in sparse graphs

被引：8
|
作者：
Dvorak, Zdenek [1 ]
机构：
[1] Charles Univ Prague, Comp Sci Inst, Malostranske Namesti 25, CR-11800 Prague, Czech Republic
来源：
JOURNAL OF GRAPH THEORY | 2019年 / 91卷 / 02期
关键词：
approximation; dominating set; independent set; weak coloring number; APPROXIMATION ALGORITHMS; EXPANSION;
D O I：
10.1002/jgt.22426
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Dvorak [European J. Combin. 34 (2013), pp. 833-840] gave a bound on the minimum size of a distance r-dominating set in terms of the maximum size of a distance 2r-independent set and generalized coloring numbers, thus obtaining a constant-factor approximation algorithm for the parameters in any class of graphs with bounded expansion. We improve and clarify this dependence using a linear programming (LP)-based argument inspired by the work of Bansal and Umboh [Inform. Process. Lett. 122 (2017), pp. 21-24].
引用
收藏
页码：162 / 173
页数：12
相关论文
共 50 条
  • [21] INDEPENDENT SETS IN RANDOM SPARSE GRAPHS
    GAZMURI, PG
    NETWORKS, 1984, 14 (03) : 367 - 377
  • [22] Independent point-set dominating sets in graphs
    Gupta, Purnima
    Goyal, Alka
    Jain, Ranjana
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (01) : 229 - 241
  • [23] Minimum independent dominating sets of random cubic graphs
    Duckworth, W
    Wormald, NC
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (02) : 147 - 161
  • [24] Independent dominating sets in triangle-free graphs
    Wayne Goddard
    Jeremy Lyle
    Journal of Combinatorial Optimization, 2012, 23 : 9 - 20
  • [25] Balanced Independent and Dominating Sets on Colored Interval Graphs
    Bhore, Sujoy
    Haunert, Jan-Henrik
    Klute, Fabian
    Li, Guangping
    Noellenburg, Martin
    SOFSEM 2021: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2021, 12607 : 89 - 103
  • [26] Independent dominating sets in triangle-free graphs
    Goddard, Wayne
    Lyle, Jeremy
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (01) : 9 - 20
  • [27] Disjoint dominating and 2-dominating sets in graphs
    Miotk, Mateusz
    Topp, Jerzy
    Zylinski, Pawel
    DISCRETE OPTIMIZATION, 2020, 35
  • [28] THE REALIZABILITY OF THETA GRAPHS AS RECONFIGURATION GRAPHS OF MINIMUM INDEPENDENT DOMINATING SETS
    Brewster, R. C.
    Mynhardt, C. M.
    Teshima, L. E.
    ANNALES MATHEMATICAE SILESIANAE, 2024,
  • [29] ON GRAPHS WITH DISJOINT DOMINATING AND 2-DOMINATING SETS
    Henning, Michael A.
    Rall, Douglas F.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (01) : 139 - 146
  • [30] Maximal and maximum independent sets in graphs with at most r cycles
    Sagan, Bruce E.
    Vatter, Vincent R.
    JOURNAL OF GRAPH THEORY, 2006, 53 (04) : 283 - 314
12345