Independent Set Reconfiguration Parameterized by Modular-Width

Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota

Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2019), Independent Set Reconfiguration Parameterized by Modular-Width, dans 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

Voir/Ouvrir

1905.00340.pdf (452.7Kb)

Type

Communication / Conférence

Date

2019

Titre du colloque

45th International Workshop on Graph-Theoretic Concepts in Computer Science

Date du colloque

2019-06

Ville du colloque

Vall de Núria

Pays du colloque

Spain

Titre de l'ouvrage

Graph-Theoretic Concepts in Computer Science, Revised Papers

Auteurs de l’ouvrage

Sau, Ignasi; Thilikos, Dimitrios M.

Éditeur

Springer International Publishing

Ville d’édition

Berlin Heidelberg

Isbn

978-3-030-30785-1;978-3-030-30786-8

Nombre de pages

394

Pages

285-297

Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ono, Hirotaka
Department of Mathematical Informatics
Otachi, Yota
Kumamoto Gakuen University

Résumé (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].

Mots-clés

Reconfiguration; Independent set; Modular-width