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 条
  • [21] Domination Defect of Some Parameterized Families of Graphs
    Miranda, Aldwin T.
    Eballe, Rolito G.
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2024, 15 (02): : 921 - 928
  • [22] On the parameterized complexity of [1, j]-domination problems
    Meybodi, Mohsen Alambardar
    Fomin, Fedor, V
    Mouawad, Amer E.
    Panolan, Fahad
    THEORETICAL COMPUTER SCIENCE, 2020, 804 : 207 - 218
  • [23] Independence and domination separation on chessboard graphs
    Chatham, R. Douglas
    Doyle, Maureen
    Fricke, Gerd H.
    Reitmann, Jon
    Skaggs, R. Duane
    Wolff, Matthew
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 68 : 3 - 17
  • [24] Independence and k-domination in graphs
    Hansberg, Adriana
    Meierling, Dirk
    Volkmann, Lutz
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (05) : 905 - 915
  • [25] INDEPENDENCE AND DOMINATION IN PATH GRAPHS OF TREES
    Niepel, Ludovit
    Cerny, Anton
    COMPUTING AND INFORMATICS, 2008, 27 (04) : 581 - 591
  • [26] The Parameterized Complexity of Geometric Graph Isomorphism
    Arvind, Vikraman
    Rattan, Gaurav
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 51 - 62
  • [27] The Parameterized Complexity of Geometric Graph Isomorphism
    V. Arvind
    Gaurav Rattan
    Algorithmica, 2016, 75 : 258 - 276
  • [28] The Parameterized Complexity of Geometric Graph Isomorphism
    Arvind, V.
    Rattan, Gaurav
    ALGORITHMICA, 2016, 75 (02) : 258 - 276
  • [29] On the Parameterized Complexity for Token Jumping on Graphs
    Ito, Takehiro
    Kaminski, Marcin
    Ono, Hirotaka
    Suzuki, Akira
    Uehara, Ryuhei
    Yamanaka, Katsuhisa
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 2014, 8402 : 341 - 351
  • [30] A parameterized view on the complexity of dependence and independence logic
    Kontinen, Juha
    Meier, Arne
    Mahmood, Yasir
    JOURNAL OF LOGIC AND COMPUTATION, 2022, 32 (08) : 1624 - 1644
12345