Affiliation:
1. University of Bergen, Norway
2. American University of Beirut, Lebanon
Abstract
We settle the complexity of the I
ndependent
S
et
R
econfiguration
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference38 articles.
1. Crown Structures for Vertex Cover Kernelization
2. Complexity of Finding Embeddings in a k-Tree
3. A tourist guide through treewidth;Bodlaender Hans L.;Acta Cybern.,1993
4. Treewidth for graphs with small chordality
5. Marthe Bonamy and Nicolas Bousquet. 2016. Token sliding on chordal graphs. CoRR abs/1605.00442 (2016). DOI:http://arxiv.org/abs/1605.00442 Marthe Bonamy and Nicolas Bousquet. 2016. Token sliding on chordal graphs. CoRR abs/1605.00442 (2016). DOI:http://arxiv.org/abs/1605.00442
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献