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 条
  • [41] Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
    Dabrowski, Konrad
    Lozin, Vadim
    Mueller, Haiko
    Rautenbach, Dieter
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 14 : 207 - 213
  • [42] New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
    Bergougnoux, Benjamin
    Korhonen, Tuukka
    Razgon, Igor
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 72 - 85
  • [43] Digraph width measures in parameterized algorithmics
    Ganian, Robert
    Hlineny, Petr
    Kneis, Joachim
    Langer, Alexander
    Obdrzalek, Jan
    Rossmanith, Peter
    DISCRETE APPLIED MATHEMATICS, 2014, 168 : 88 - 107
  • [44] On Digraph Width Measures in Parameterized Algorithmics
    Ganian, Robert
    Hlineny, Petr
    Kneis, Joachim
    Langer, Alexander
    Obdrzalek, Jan
    Rossmanith, Peter
    PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 185 - +
  • [45] ISBA: An Independent Set-Based Algorithm for Automated Partial Reconfiguration Module Generation
    He, Ruining
    Ma, Yuchun
    Zhao, Kang
    Bian, Jinian
    2012 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2012, : 500 - 507
  • [46] Structural design for modular integrated construction with parameterized level set-based topology optimization method
    Wei, Peng
    Liu, Yang
    Dai, Jian-Guo
    Li, Zuyu
    Xu, Yufeng
    STRUCTURES, 2021, 31 : 1265 - 1277
  • [47] A modular and parameterized presentation of pregroup calculus
    Foret, Annie
    INFORMATION AND COMPUTATION, 2010, 208 (05) : 510 - 520
  • [48] Parameterized complexity of safe set
    Belmonte R.
    Hanaka T.
    Katsikarelis I.
    Lampis M.
    Ono H.
    Otachi Y.
    Journal of Graph Algorithms and Applications, 2020, 24 (03) : 215 - 245
  • [49] Parameterized Complexity of Geodetic Set
    Kellerhals L.
    Koana T.
    Journal of Graph Algorithms and Applications, 2022, 26 (04) : 401 - 419
  • [50] Parameterized Complexity of Safe Set
    Belmonte, Rémy
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Ono, Hirotaka
    Otachi, Yota
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, 11485 LNCS : 38 - 49
12345