Independent Set Reconfiguration Parameterized by Modular-Width

Thumbnail
View/Open
Date
2019
Dewey
Principes généraux des mathématiques
Sujet
Reconfiguration; Independent set; Modular-width
DOI
http://dx.doi.org/10.1007/978-3-030-30786-8_22
Conference name
45th International Workshop on Graph-Theoretic Concepts in Computer Science
Conference date
06-2019
Conference city
Vall de Núria
Conference country
Spain
Book title
Graph-Theoretic Concepts in Computer Science, Revised Papers
Author
Sau, Ignasi; Thilikos, Dimitrios M.
Publisher
Springer International Publishing
Publisher city
Berlin Heidelberg
Year
2019
Pages number
394
ISBN
978-3-030-30785-1;978-3-030-30786-8
Book URL
10.1007/978-3-030-30786-8
URI
https://basepub.dauphine.fr/handle/123456789/20331
Collections
Metadata
Show full item record
Author
Belmonte, Rémy
115536 autre
Hanaka, Tesshu
status unknown
Lampis, Michael
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ono, Hirotaka
228737 Department of Mathematical Informatics
Otachi, Yota
58827 Kumamoto Gakuen University
Type
Communication / Conférence
Item number of pages
285-297
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].