collaborators

1 paper

cs.DS2026

NP-Hardness of Connected Components Reconfiguration under Component Jumping on Caterpillar Graphs

Naoki Kitamura, Seitaro Kawaguchi, Yuya Terashima +1

We study the Connected Components Reconfiguration problem (CCR), in which connected components on a graph are transformed according to a specified reconfiguration rule. CCR general…