The complexity of independent set reconfiguration on bipartite graphs
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery
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. © 2018 Association for Computing Machinery.
Description
Keywords
Bipartite graphs, Independent set, Reconfiguration, Solution space, Vertex cover, Algorithms, Mathematical techniques, Graph theory