The complexity of independent set reconfiguration on bipartite graphs

Simple item page
dc.contributor.authorLokshtanov, Daniel
dc.contributor.authorMouawad, Amer E.
dc.contributor.departmentDepartment of Computer Science
dc.contributor.facultyFaculty of Arts and Sciences (FAS)
dc.contributor.institutionAmerican University of Beirut
dc.date.accessioned2025-01-24T11:22:57Z
dc.date.available2025-01-24T11:22:57Z
dc.date.issued2018
dc.description.abstractWe 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.
dc.identifier.doihttps://doi.org/10.1145/3280825
dc.identifier.eid2-s2.0-85056798239
dc.identifier.urihttp://hdl.handle.net/10938/25575
dc.language.isoen
dc.publisherAssociation for Computing Machinery
dc.relation.ispartofACM Transactions on Algorithms
dc.sourceScopus
dc.subjectBipartite graphs
dc.subjectIndependent set
dc.subjectReconfiguration
dc.subjectSolution space
dc.subjectVertex cover
dc.subjectAlgorithms
dc.subjectMathematical techniques
dc.subjectGraph theory
dc.titleThe complexity of independent set reconfiguration on bipartite graphs
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
2018-8471.pdf
Size:
461.16 KB
Format:
Adobe Portable Document Format
Download

Collections

Department of Computer Science