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 条
  • [31] Independent-set reconfiguration thresholds of hereditary graph classes
    de Berg, Mark
    Jansen, Bart M. P.
    Mukherjee, Debankur
    DISCRETE APPLIED MATHEMATICS, 2018, 250 : 165 - 182
  • [32] Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
    Dabrowski, Konrad
    Lozin, Vadim
    Mueller, Haiko
    Rautenbach, Dieter
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 1 - +
  • [33] A survey on the parameterized complexity of reconfiguration problems
    Bousquet, Nicolas
    Mouawad, Amer E.
    Nishimura, Naomi
    Siebertz, Sebastian
    COMPUTER SCIENCE REVIEW, 2024, 53
  • [34] TWIN-WIDTH III: MAX INDEPENDENT SET, MIN DOMINATING SET, AND COLORING
    Bonnet, Edouard
    Geniet, Colin
    Kim, Eun Jung
    Thomasse, Stephan
    Watrigant, Remi
    SIAM Journal on Computing, 2024, 53 (05) : 1602 - 1640
  • [35] Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
    Alber, Jochen
    Fiala, Jirí
    IFIP Advances in Information and Communication Technology, 2002, 96 : 26 - 37
  • [36] Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
    Alber, J
    Fiala, J
    FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 26 - 37
  • [37] Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
    Alber, J
    Fiala, J
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 52 (02): : 134 - 151
  • [38] RECONFIGURATION AND MESSAGE LOSSES IN PARAMETERIZED BROADCAST NETWORKS
    Bertrand, Nathalie
    Bouyer, Patricia
    Majumdar, Anirban
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (01) : 23:1 - 23:19
  • [39] On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
    Lokshtanov, Daniel
    Mouawad, Amer E.
    Panolan, Fahad
    Siebertz, Sebastian
    ALGORITHMICA, 2022, 84 (02) : 482 - 509
  • [40] On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
    Daniel Lokshtanov
    Amer E. Mouawad
    Fahad Panolan
    Sebastian Siebertz
    Algorithmica, 2022, 84 : 482 - 509
12345