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 journalArticlepeer-review

4 Citations (Scopus)


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 languageEnglish
Pages (from-to)553-566
Number of pages14
JournalTheoretical Computer Science
Publication statusPublished - 2020 Feb 2


  • Combinatorial reconfiguration
  • Graph algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this