6 citations · 24 across the 32 of their papers we have counts for
Showing 2018 · cs.DMShow all
2 papers · 2 filters
cs.DM2018
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Given a tournament , the problem MaxCT consists of finding a maximum (arc-disjoint) cycle packing of . In the same way, MaxTT corresponds to the specific case where the colle…
cs.DM2018
Dynamic monopolies for interval graphs with bounded thresholds
Stéphane Bessy, Stefan Ehard, Lucia D. Penso +1
For a graph and an integer-valued threshold function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of $G…