Shortest reconfiguration sequences for independent sets under connected symmetric difference are NP-hard on planar and split graphs but polynomial-time solvable on block graphs, cographs, and bipartite chain graphs.
The complexity of change
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
Shortest reconfiguration sequences for independent sets under connected symmetric difference are NP-hard on planar and split graphs but polynomial-time solvable on block graphs, cographs, and bipartite chain graphs.