2000 character limit reached
The complexity of independent set reconfiguration on bipartite graphs
Published 9 Jul 2017 in cs.CC and cs.DM | (1707.02638v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
