Abstract
Token Sliding Optimization asks whether there exists a sequence of at most ℓ steps that transforms independent set S into T, where at each step a token slides to an unoccupied neighboring vertex (while maintaining independence). In Token Jumping Optimization, we are instead allowed to jump from a vertex to any unoccupied vertex. Both problems are known to be FPT when parameterized by ℓ on nowhere dense graphs. In this work, we show that both problems are FPT for parameter k+ℓ+d on d-degenerate graphs as well as for parameter |M|+ℓ+Δ on graphs having a modulator M to maximum degree Δ. We complement these results by showing that for parameter ℓ both problems become hard already on 2-degenerate graphs. Finally, we show that using such families one can obtain a unified algorithm for the standard Token Jumping problem parameterized by k on degenerate and nowhere dense graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
