Independent Set Reconfiguration Parameterized by Modular-Width
Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2019), Independent Set Reconfiguration Parameterized by Modular-Width, in Sau, Ignasi; Thilikos, Dimitrios M., Graph-Theoretic Concepts in Computer Science, Revised Papers, Springer International Publishing : Berlin Heidelberg, p. 285-297. 10.1007/978-3-030-30786-8_22
TypeCommunication / Conférence
Conference title45th International Workshop on Graph-Theoretic Concepts in Computer Science
Conference cityVall de Núria
Book titleGraph-Theoretic Concepts in Computer Science, Revised Papers
Book authorSau, Ignasi; Thilikos, Dimitrios M.
Number of pages394
MetadataShow full item record
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Department of Mathematical Informatics
Kumamoto Gakuen University
Abstract (EN)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, TJ, and TS. The result under TAR resolves an open problem posed by Bonsma [WG 2014, JGT 2016].
Subjects / KeywordsReconfiguration; Independent set; Modular-width
Showing items related by title and author.