12 citations · 41 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017★ 10 cited
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…
cs.CC2017★ 5 cited
Token Jumping in minor-closed classes
Nicolas Bousquet, Arnaud Mary, Aline Parreau
Given two -independent sets and of a graph , one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex…