The complexity of independent set reconfiguration on bipartite graphs
Daniel Lokshtanov, Amer E. Mouawad
TL;DR
This paper determines the computational complexity of the Independent Set Reconfiguration problem on bipartite graphs across three models, establishing NP-completeness for two and PSPACE-completeness for the third.
Contribution
It provides a comprehensive complexity classification for the problem on bipartite graphs under all major reconfiguration models, resolving open questions.
Findings
NP-complete under token jumping and token addition/removal models
PSPACE-complete under token sliding model
Completes the complexity landscape for this problem on bipartite graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.