Reconfiguration of Regular Induced Subgraphs

Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa

doi:10.1007/978-3-030-96731-4_4

Reconfiguration of Regular Induced Subgraphs

Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa

INF - System Information Sciences

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

Abstract

We study the problem of checking the existence of a step-by-step transformation of d-regular induced subgraphs in a graph, where d≥ 0 and each step in the transformation must follow a fixed reconfiguration rule. Our problem for d= 0 is equivalent to Independent Set Reconfiguration, which is one of the most well-studied reconfiguration problems. In this paper, we systematically investigate the complexity of the problem, in particular, on chordal graphs and bipartite graphs. Our results give interesting contrasts to known ones for Independent Set Reconfiguration.

Original language	English
Title of host publication	WALCOM
Subtitle of host publication	Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings
Editors	Petra Mutzel, Md. Saidur Rahman, Slamin
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	35-46
Number of pages	12
ISBN (Print)	9783030967307
DOIs	https://doi.org/10.1007/978-3-030-96731-4_4
Publication status	Published - 2022
Event	16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 - Jember, Indonesia Duration: 2022 Mar 24 → 2022 Mar 26

Publication series

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

Conference

Conference	16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
Country/Territory	Indonesia
City	Jember
Period	22/3/24 → 22/3/26

Keywords

Combinatorial reconfiguration
Computational complexity
Regular induced subgraph

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-96731-4_4

Cite this

Eto, H., Ito, T., Kobayashi, Y., Otachi, Y., & Wasa, K. (2022). Reconfiguration of Regular Induced Subgraphs. In P. Mutzel, M. S. Rahman, & Slamin (Eds.), WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings (pp. 35-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13174 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-96731-4_4

Reconfiguration of Regular Induced Subgraphs. / Eto, Hiroshi ; Ito, Takehiro; Kobayashi, Yasuaki et al.

WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. ed. / Petra Mutzel; Md. Saidur Rahman; Slamin. Springer Science and Business Media Deutschland GmbH, 2022. p. 35-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13174 LNCS).

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

Eto, H , Ito, T, Kobayashi, Y, Otachi, Y & Wasa, K 2022, Reconfiguration of Regular Induced Subgraphs. in P Mutzel, MS Rahman & Slamin (eds), WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13174 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 35-46, 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022, Jember, Indonesia, 22/3/24. https://doi.org/10.1007/978-3-030-96731-4_4

Eto H , Ito T, Kobayashi Y, Otachi Y, Wasa K. Reconfiguration of Regular Induced Subgraphs. In Mutzel P, Rahman MS, Slamin, editors, WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 35-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-96731-4_4

Eto, Hiroshi ; Ito, Takehiro ; Kobayashi, Yasuaki et al. / Reconfiguration of Regular Induced Subgraphs. WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. editor / Petra Mutzel ; Md. Saidur Rahman ; Slamin. Springer Science and Business Media Deutschland GmbH, 2022. pp. 35-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{42c4daf3c8ff424da78d9f20a7f00f4b,

title = "Reconfiguration of Regular Induced Subgraphs",

abstract = "We study the problem of checking the existence of a step-by-step transformation of d-regular induced subgraphs in a graph, where d≥ 0 and each step in the transformation must follow a fixed reconfiguration rule. Our problem for d= 0 is equivalent to Independent Set Reconfiguration, which is one of the most well-studied reconfiguration problems. In this paper, we systematically investigate the complexity of the problem, in particular, on chordal graphs and bipartite graphs. Our results give interesting contrasts to known ones for Independent Set Reconfiguration.",

keywords = "Combinatorial reconfiguration, Computational complexity, Regular induced subgraph",

author = "Hiroshi Eto and Takehiro Ito and Yasuaki Kobayashi and Yota Otachi and Kunihiro Wasa",

note = "Funding Information: Partially supported by JSPS KAKENHI Grant Numbers JP18H04091, JP18K11168, JP18K11169, JP19K11814, JP19K20350, JP20H05793, JP20K19742, JP21H03499 and JP21K11752, and JST CREST Grant Number JPMJCR18K3, Japan. Publisher Copyright: {\textcopyright} 2022, Springer Nature Switzerland AG.; 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 ; Conference date: 24-03-2022 Through 26-03-2022",

year = "2022",

doi = "10.1007/978-3-030-96731-4_4",

language = "English",

isbn = "9783030967307",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "35--46",

editor = "Petra Mutzel and Rahman, {Md. Saidur} and Slamin",

booktitle = "WALCOM",

address = "Germany",

}

TY - GEN

T1 - Reconfiguration of Regular Induced Subgraphs

AU - Eto, Hiroshi

AU - Ito, Takehiro

AU - Kobayashi, Yasuaki

AU - Otachi, Yota

AU - Wasa, Kunihiro

N1 - Funding Information: Partially supported by JSPS KAKENHI Grant Numbers JP18H04091, JP18K11168, JP18K11169, JP19K11814, JP19K20350, JP20H05793, JP20K19742, JP21H03499 and JP21K11752, and JST CREST Grant Number JPMJCR18K3, Japan. Publisher Copyright: © 2022, Springer Nature Switzerland AG.

PY - 2022

Y1 - 2022

N2 - We study the problem of checking the existence of a step-by-step transformation of d-regular induced subgraphs in a graph, where d≥ 0 and each step in the transformation must follow a fixed reconfiguration rule. Our problem for d= 0 is equivalent to Independent Set Reconfiguration, which is one of the most well-studied reconfiguration problems. In this paper, we systematically investigate the complexity of the problem, in particular, on chordal graphs and bipartite graphs. Our results give interesting contrasts to known ones for Independent Set Reconfiguration.

AB - We study the problem of checking the existence of a step-by-step transformation of d-regular induced subgraphs in a graph, where d≥ 0 and each step in the transformation must follow a fixed reconfiguration rule. Our problem for d= 0 is equivalent to Independent Set Reconfiguration, which is one of the most well-studied reconfiguration problems. In this paper, we systematically investigate the complexity of the problem, in particular, on chordal graphs and bipartite graphs. Our results give interesting contrasts to known ones for Independent Set Reconfiguration.

KW - Combinatorial reconfiguration

KW - Computational complexity

KW - Regular induced subgraph

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

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

U2 - 10.1007/978-3-030-96731-4_4

DO - 10.1007/978-3-030-96731-4_4

M3 - Conference contribution

AN - SCOPUS:85127912089

SN - 9783030967307

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

SP - 35

EP - 46

BT - WALCOM

A2 - Mutzel, Petra

A2 - Rahman, Md. Saidur

A2 - Slamin, null

PB - Springer Science and Business Media Deutschland GmbH

T2 - 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022

Y2 - 24 March 2022 through 26 March 2022

ER -