5 citations · 7 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018★ 1 cited
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…
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…