Independent Set Reconfiguration Parameterized by Modular-Width

被引：3
|
作者：
Belmonte, Remy [1 ]
Hanaka, Tesshu [2 ]
Lampis, Michael [3 ]
Ono, Hirotaka [4 ]
Otachi, Yota [4 ]
机构：
[1] Univ Electrocommun, Chofu, Tokyo 1828585, Japan
[2] Chuo Univ, Bunkyo Ku, Tokyo 1128551, Japan
[3] PSL Univ, Univ Paris Dauphine, CNRS, LAMSADE, F-75016 Paris, France
[4] Nagoya Univ, Nagoya, Aichi 4648601, Japan
来源：
ALGORITHMICA | 2020年 / 82卷 / 09期
关键词：
Reconfiguration; Independent set; Modular-width; COMPLEXITY;
D O I：
10.1007/s00453-020-00700-y
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Independent Set Reconfiguration is one of the most well-studied problems in the setting of combinatorial reconfiguration. It is known that the problem is PSPACE-complete even for graphs of bounded bandwidth. This fact rules out the tractability of parameterizations by most well-studied structural parameters as most of them generalize bandwidth. In this paper, we study the parameterization by modular-width, which is not comparable with bandwidth. We show that the problem parameterized by modular-width is fixed-parameter tractable under all previously studied rules TAR resolves an open problem posed by Bonsma (J Graph Theory 83(2):164-195, 2016).
引用
收藏
页码：2586 / 2605
页数：20
相关论文
共 50 条
  • [21] Parameterized Complexity of Independent Set in H-Free Graphs
    Bonnet, Edouard
    Bousquet, Nicolas
    Charbit, Pierre
    Thomasse, Stephan
    Watrigant, Remi
    ALGORITHMICA, 2020, 82 (08) : 2360 - 2394
  • [22] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Dvorak, Pavel
    Feldmann, Andreas Emil
    Rai, Ashutosh
    Rzazewski, Pawel
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 40 - 53
  • [23] Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
    Grandoni, Fabrizio
    Kratsch, Stefan
    Wiese, Andreas
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [24] Parameterized Complexity of Independent Set in H-Free Graphs
    Édouard Bonnet
    Nicolas Bousquet
    Pierre Charbit
    Stéphan Thomassé
    Rémi Watrigant
    Algorithmica, 2020, 82 : 2360 - 2394
  • [25] An improved parameterized algorithm for the independent feedback vertex set problem
    Song, Yinglei
    THEORETICAL COMPUTER SCIENCE, 2014, 535 : 25 - 30
  • [26] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Dvorak, Pavel
    Feldmann, Andreas Emil
    Rai, Ashutosh
    Rzazewski, Pawel
    ALGORITHMICA, 2023, 85 (04) : 902 - 928
  • [27] Parameterized Shortest Path Reconfiguration
    Bousquet, Nicolas
    Gajjar, Kshitij
    Lahiri, Abhiruk
    Mouawad, Amer E.
    arXiv,
  • [28] On the Parameterized Complexity of Reconfiguration Problems
    Amer E. Mouawad
    Naomi Nishimura
    Venkatesh Raman
    Narges Simjour
    Akira Suzuki
    Algorithmica, 2017, 78 : 274 - 297
  • [29] On the Parameterized Complexity of Reconfiguration Problems
    Mouawad, Amer E.
    Nishimura, Naomi
    Raman, Venkatesh
    Simjour, Narges
    Suzuki, Akira
    ALGORITHMICA, 2017, 78 (01) : 274 - 297
  • [30] Parameterized Complexity of Reconfiguration of Atoms
    Cooper, Alexandre
    Maaz, Stephanie
    Mouawad, Amer E.
    Nishimura, Naomi
    ALGORITHMICA, 2024, 86 (10) : 3284 - 3308
12345