On girth and the parameterized complexity of token sliding and token jumping

Valentin Bartier, Nicolas Bousquet, Clément Dallard +2

In the Token Jumping problem we are given a graph $G=(V,E)$ and two independent sets $S$ and $T$ of $G$, each of size $k\ge 1$. The goal is to determine whether there exists a…