Independent Set Reconfiguration Parameterized by Modular-Width

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

doi:10.1007/978-3-030-30786-8_22

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 proceeding › Conference contribution

Abstract

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 language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers
Editors	Ignasi Sau, Dimitrios M. Thilikos
Publisher	Springer Verlag
Pages	285-297
Number of pages	13
ISBN (Print)	9783030307851
DOIs	https://doi.org/10.1007/978-3-030-30786-8_22
Publication status	Published - 2019
Externally published	Yes
Event	45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 - Catalonia, Spain Duration: Jun 19 2019 → Jun 21 2019

Publication series

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

Conference

Conference	45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019
Country/Territory	Spain
City	Catalonia
Period	6/19/19 → 6/21/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-30786-8_22

Cite this

Belmonte, R., Hanaka, T., Lampis, M., Ono, H., & Otachi, Y. (2019). Independent Set Reconfiguration Parameterized by Modular-Width. In I. Sau, & D. M. Thilikos (Eds.), Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers (pp. 285-297). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11789 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-30786-8_22

Independent Set Reconfiguration Parameterized by Modular-Width. / Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael et al.

Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. ed. / Ignasi Sau; Dimitrios M. Thilikos. Springer Verlag, 2019. p. 285-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11789 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Belmonte, R, Hanaka, T, Lampis, M, Ono, H & Otachi, Y 2019, Independent Set Reconfiguration Parameterized by Modular-Width. in I Sau & DM Thilikos (eds), Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11789 LNCS, Springer Verlag, pp. 285-297, 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, Catalonia, Spain, 6/19/19. https://doi.org/10.1007/978-3-030-30786-8_22

Belmonte R, Hanaka T, Lampis M, Ono H, Otachi Y. Independent Set Reconfiguration Parameterized by Modular-Width. In Sau I, Thilikos DM, editors, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Springer Verlag. 2019. p. 285-297. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-30786-8_22

Belmonte, Rémy ; Hanaka, Tesshu ; Lampis, Michael et al. / Independent Set Reconfiguration Parameterized by Modular-Width. Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. editor / Ignasi Sau ; Dimitrios M. Thilikos. Springer Verlag, 2019. pp. 285-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4c6cc05506b24b1c925b8d65abdf986d,

title = "Independent Set Reconfiguration Parameterized by Modular-Width",

abstract = "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].",

author = "R{\'e}my Belmonte and Tesshu Hanaka and Michael Lampis and Hirotaka Ono and Yota Otachi",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 ; Conference date: 19-06-2019 Through 21-06-2019",

year = "2019",

doi = "10.1007/978-3-030-30786-8_22",

language = "English",

isbn = "9783030307851",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "285--297",

editor = "Ignasi Sau and Thilikos, {Dimitrios M.}",

booktitle = "Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers",

address = "Germany",

}

TY - GEN

T1 - Independent Set Reconfiguration Parameterized by Modular-Width

AU - Belmonte, Rémy

AU - Hanaka, Tesshu

AU - Lampis, Michael

AU - Ono, Hirotaka

AU - Otachi, Yota

PY - 2019

Y1 - 2019

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=85072864150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072864150&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-30786-8_22

DO - 10.1007/978-3-030-30786-8_22

M3 - Conference contribution

AN - SCOPUS:85072864150

SN - 9783030307851

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 285

EP - 297

BT - Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers

A2 - Sau, Ignasi

A2 - Thilikos, Dimitrios M.

PB - Springer Verlag

T2 - 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019

Y2 - 19 June 2019 through 21 June 2019

ER -

Independent Set Reconfiguration Parameterized by Modular-Width

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this