Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Revisiting Token Sliding on Chordal Graphs
Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale
In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} pro…
cs.DS2022
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
Neeldhara Misra, Saraswati Nanoti
Eternal Vertex Cover problem is a dynamic variant of the vertex cover problem. We have a two player game in which guards are placed on some vertices of a graph. In every move, one…