Thumbnail

Independent Set Reconfiguration Parameterized by Modular-Width

Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2020), Independent Set Reconfiguration Parameterized by Modular-Width, Algorithmica, 82, 9, p. 2586–2605. 10.1007/s00453-020-00700-y

View/Open
Type
Article accepté pour publication ou publié
Date
2020
Journal name
Algorithmica
Volume
82
Number
9
Publisher
Springer
Pages
2586–2605
Publication identifier
Metadata
Show full item record
Author(s)
Belmonte, Rémy
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Hanaka, Tesshu
Lampis, Michael
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ono, Hirotaka
Otachi, Yota
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 (J Graph Theory 83(2):164–195, 2016).
Subjects / Keywords
reconfiguration; independent set; modular-width