Parameterized complexity of independence and domination on geometric graphs

被引：0
|
作者：
Marx, Daniel [1 ]
机构：
[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany
来源：
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS | 2006年 / 4169卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate the parameterized complexity of MAXIMUM INDEPENDENT SET and DOMINATING SET restricted to certain geometric graphs. We show that DOMINATING SET is W[l]-hard for the intersection graphs of unit squares, unit disks, and line segments. For MAXIMUM INDEPENDENT SET, we show that the problem is W[l]-complete for unit segments, but fixed-parameter tractable if the segments axe axis-parallel.
引用
收藏
页码：154 / 165
页数：12
相关论文
共 50 条
  • [41] THE COMPLEXITY OF DOMINATION PROBLEMS IN CIRCLE GRAPHS
    KEIL, JM
    DISCRETE APPLIED MATHEMATICS, 1993, 42 (01) : 51 - 63
  • [42] The algorithmic complexity of mixed domination in graphs
    Zhao, Yancai
    Kang, Liying
    Sohn, Moo Young
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2387 - 2392
  • [43] THE COMPLEXITY OF SECURE DOMINATION PROBLEM IN GRAPHS
    Wang, Haichao
    Zhao, Yancai
    Deng, Yunping
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (02) : 385 - 396
  • [44] More on the complexity of defensive domination in graphs
    Henning, Michael A.
    Pandey, Arti
    Tripathi, Vikash
    DISCRETE APPLIED MATHEMATICS, 2025, 362 : 167 - 179
  • [45] On graphs with equal domination and edge independence numbers
    Volkmann, L
    ARS COMBINATORIA, 1995, 41 : 45 - 56
  • [46] CONTRIBUTIONS TO THE THEORY OF DOMINATION, INDEPENDENCE AND IRREDUNDANCE IN GRAPHS
    COCKAYNE, EJ
    FAVARON, O
    PAYAN, C
    THOMASON, AG
    DISCRETE MATHEMATICS, 1981, 33 (03) : 249 - 258
  • [47] INDEPENDENCE SATURATION AND EXTENDED DOMINATION CHAIN IN GRAPHS
    Arumugam, S.
    Subramanian, M.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2007, 4 (02) : 171 - 181
  • [48] On the Complexity of Reverse Minus Domination on Graphs
    Lee, Chuan-Min
    Lo, Cheng-Chien
    2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 1121 - 1126
  • [49] Complexity and Algorithms for Semipaired Domination in Graphs
    Michael A. Henning
    Arti Pandey
    Vikash Tripathi
    Theory of Computing Systems, 2020, 64 : 1225 - 1241
  • [50] Independence-domination duality in weighted graphs
    Aharoni, Ron
    Gorelik, Irina
    DISCRETE MATHEMATICS, 2018, 341 (08) : 2332 - 2336
12345