Reconfiguring spanning and induced subgraphs

Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki; Krishna Vaidyanathan

doi:10.1007/978-3-319-94776-1_36

Reconfiguring spanning and induced subgraphs

Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

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

4 Citations (Scopus)

Abstract

Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.

Original language	English
Title of host publication	Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings
Editors	Daming Zhu, Lusheng Wang
Publisher	Springer Verlag
Pages	428-440
Number of pages	13
ISBN (Print)	9783319947754
DOIs	https://doi.org/10.1007/978-3-319-94776-1_36
Publication status	Published - 2018
Externally published	Yes
Event	24th International Conference on Computing and Combinatorics Conference, COCOON 2018 - Qing Dao, China Duration: Jul 2 2018 → Jul 4 2018

Publication series

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

Conference

Conference	24th International Conference on Computing and Combinatorics Conference, COCOON 2018
Country/Territory	China
City	Qing Dao
Period	7/2/18 → 7/4/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-94776-1_36

Cite this

Hanaka, T., Ito, T., Mizuta, H., Moore, B., Nishimura, N., Subramanya, V., Suzuki, A., & Vaidyanathan, K. (2018). Reconfiguring spanning and induced subgraphs. In D. Zhu, & L. Wang (Eds.), Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings (pp. 428-440). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10976 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-94776-1_36

Reconfiguring spanning and induced subgraphs. / Hanaka, Tesshu; Ito, Takehiro; Mizuta, Haruka et al.
Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. ed. / Daming Zhu; Lusheng Wang. Springer Verlag, 2018. p. 428-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10976 LNCS).

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

Hanaka, T, Ito, T, Mizuta, H, Moore, B, Nishimura, N, Subramanya, V, Suzuki, A & Vaidyanathan, K 2018, Reconfiguring spanning and induced subgraphs. in D Zhu & L Wang (eds), Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10976 LNCS, Springer Verlag, pp. 428-440, 24th International Conference on Computing and Combinatorics Conference, COCOON 2018, Qing Dao, China, 7/2/18. https://doi.org/10.1007/978-3-319-94776-1_36

Hanaka T, Ito T, Mizuta H, Moore B, Nishimura N, Subramanya V et al. Reconfiguring spanning and induced subgraphs. In Zhu D, Wang L, editors, Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer Verlag. 2018. p. 428-440. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-94776-1_36

Hanaka, Tesshu ; Ito, Takehiro ; Mizuta, Haruka et al. / Reconfiguring spanning and induced subgraphs. Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. editor / Daming Zhu ; Lusheng Wang. Springer Verlag, 2018. pp. 428-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{de935f9836f0411b83528407e1696da5,

title = "Reconfiguring spanning and induced subgraphs",

abstract = "Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.",

author = "Tesshu Hanaka and Takehiro Ito and Haruka Mizuta and Benjamin Moore and Naomi Nishimura and Vijay Subramanya and Akira Suzuki and Krishna Vaidyanathan",

note = "Funding Information: This work is partially supported by JST ERATO Grant Number JPMJER1201, JST CREST Grant Number JPMJCR1402, and JSPS KAKENHI Grant Numbers JP16K00004 and JP17K12636, Japan. Research by Canadian authors is supported by the Natural Science and Engineering Research Council of Canada. Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 24th International Conference on Computing and Combinatorics Conference, COCOON 2018 ; Conference date: 02-07-2018 Through 04-07-2018",

year = "2018",

doi = "10.1007/978-3-319-94776-1_36",

language = "English",

isbn = "9783319947754",

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

publisher = "Springer Verlag",

pages = "428--440",

editor = "Daming Zhu and Lusheng Wang",

booktitle = "Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Reconfiguring spanning and induced subgraphs

AU - Hanaka, Tesshu

AU - Ito, Takehiro

AU - Mizuta, Haruka

AU - Moore, Benjamin

AU - Nishimura, Naomi

AU - Subramanya, Vijay

AU - Suzuki, Akira

AU - Vaidyanathan, Krishna

N1 - Funding Information: This work is partially supported by JST ERATO Grant Number JPMJER1201, JST CREST Grant Number JPMJCR1402, and JSPS KAKENHI Grant Numbers JP16K00004 and JP17K12636, Japan. Research by Canadian authors is supported by the Natural Science and Engineering Research Council of Canada. Publisher Copyright: © 2018, Springer International Publishing AG, part of Springer Nature.

PY - 2018

Y1 - 2018

N2 - Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.

AB - Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.

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

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

U2 - 10.1007/978-3-319-94776-1_36

DO - 10.1007/978-3-319-94776-1_36

M3 - Conference contribution

AN - SCOPUS:85049683644

SN - 9783319947754

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

SP - 428

EP - 440

BT - Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings

A2 - Zhu, Daming

A2 - Wang, Lusheng

PB - Springer Verlag

T2 - 24th International Conference on Computing and Combinatorics Conference, COCOON 2018

Y2 - 2 July 2018 through 4 July 2018

ER -

Reconfiguring spanning and induced subgraphs

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this