2000 character limit reached
The complexity of independent set reconfiguration on bipartite graphs (1707.02638v1)
Published 9 Jul 2017 in cs.CC and cs.DM
Abstract: We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model the problem is NP-complete. For the token sliding model, we show that the problem remains PSPACE-complete.