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
N1 - Funding Information:
We thank anonymous referees of the preliminary version [6] and of this journal version for their helpful suggestions. This work is partially supported by JST ERATO Grant Number JPMJER1201 , JST CREST Grant Number JPMJCR1402 , and JSPS KAKENHI Grant Numbers JP16K00004 , JP17K12636 , JP18H04091 , JP18H06469 , and JP19K11814 , Japan. Research by Canadian authors is supported by the Natural Sciences and Engineering Research Council of Canada Grant Number RGPIN-2016-03621 .
Publisher Copyright:
© 2019 Elsevier B.V.
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 -