Reconfiguring spanning and induced subgraphs

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

doi:10.1016/j.tcs.2019.09.018

Reconfiguring spanning and induced subgraphs

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

Research output: Contribution to journal › Article

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
Pages (from-to)	553-566
Number of pages	14
Journal	Theoretical Computer Science
Volume	806
DOIs	https://doi.org/10.1016/j.tcs.2019.09.018
Publication status	Published - 2020 Feb 2

Keywords

Combinatorial reconfiguration
Graph algorithm

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2019.09.018

Fingerprint Dive into the research topics of 'Reconfiguring spanning and induced subgraphs'. Together they form a unique fingerprint.

Cite this

Hanaka, T., Ito, T., Mizuta, H., Moore, B., Nishimura, N., Subramanya, V., Suzuki, A., & Vaidyanathan, K. (2020). Reconfiguring spanning and induced subgraphs. Theoretical Computer Science, 806, 553-566. https://doi.org/10.1016/j.tcs.2019.09.018

@article{65e86a17b37b4c1ba2ce2f32f27dac17,

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.",

keywords = "Combinatorial reconfiguration, Graph algorithm",

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

year = "2020",

month = feb,

day = "2",

doi = "10.1016/j.tcs.2019.09.018",

language = "English",

volume = "806",

pages = "553--566",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

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

PY - 2020/2/2

Y1 - 2020/2/2

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.

KW - Combinatorial reconfiguration

KW - Graph algorithm

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

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

U2 - 10.1016/j.tcs.2019.09.018

DO - 10.1016/j.tcs.2019.09.018

M3 - Article

AN - SCOPUS:85072273843

VL - 806

SP - 553

EP - 566

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -