dc.contributor.advisor |
E. Mouawad, Amer |
dc.contributor.author |
Chebaro, Ezzat |
dc.date.accessioned |
2022-09-02T04:37:02Z |
dc.date.available |
2022-09-02T04:37:02Z |
dc.date.issued |
2022-09-02 |
dc.date.submitted |
2022-09-02 |
dc.identifier.uri |
http://hdl.handle.net/10938/23533 |
dc.description.abstract |
We study the complexity of the polynomially equivalent Minimum Vertex
Cover Reconfiguration and Maximum Independent Set Reconfiguration
problems on a variety of graph classes, which ask whether there exists
a reconfiguration sequence between two minimum vertex covers/maximum independent
sets S and T of a graph G. The problems are studied under the token
jumping and token sliding models, which turn out to be equivalent in this context.
We show that the problems are in P when restricted to bipartite graphs,
PSPACE-complete when restricted to planar graphs, as well as a list of results
on a variety of other graph classes. |
dc.language.iso |
en |
dc.title |
On the Complexity of the Maximum Independent Set Reconfiguration Problem |
dc.type |
Thesis |
dc.contributor.department |
Computer Science |
dc.contributor.commembers |
El Hajj, Izzat |
dc.contributor.commembers |
El Hajj, Wassim |
dc.contributor.degree |
MS |
dc.contributor.AUBidnumber |
201703028 |
dc.contributor.authorFaculty |
Faculty of Arts and Sciences |