Conference Proceedings

The complexity of independent set reconfiguration on bipartite graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2018) 185-195
DOI: 10.1137/1.9781611975031.13
21Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lokshtanov, D., & Mouawad, A. E. (2018). The complexity of independent set reconfiguration on bipartite graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 185–195). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free