7 citations · 8 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Token sliding on graphs of girth five
Valentin Bartier, Nicolas Bousquet, Jihad Hanna +2
In the Token Sliding problem we are given a graph and two independent sets and in of size . The goal is to decide whether there exists a sequence $\la…
cs.CC2022★ 7 cited
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura +1
A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices…