Independent Set Reconfiguration Parameterized by Modular-Width

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 $$\mathsf {TAR}$$, $$\mathsf {TJ}$$, and $$\mathsf {TS}$$. The result under $$\mathsf {TAR}$$ resolves an open problem posed by Bonsma [WG 2014, JGT 2016].

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers
EditorsIgnasi Sau, Dimitrios M. Thilikos
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783030307851
Publication statusPublished - 2019
Externally publishedYes
Event45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 - Catalonia, Spain
Duration: Jun 19 2019Jun 21 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11789 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Independent Set Reconfiguration Parameterized by Modular-Width'. Together they form a unique fingerprint.

Cite this