2021/11/26 by Hiroshi Eto, Eto, Hiroshi, Takehiro Ito +7 · 1 citation
Biochemistry, Genetics and Molecular Biology · Engineering · #14-3-3 protein interactions #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Flexible and Reconfigurable Manufacturing Systems
paper · pdf · doi:10.48550/arxiv.2111.13476
openalex publication_date 2021/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.