4 citations · 13 across the 16 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021
Locating Dominating Sets in local tournaments
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque +1
A dominating set in a directed graph is a set of vertices such that all the vertices that do not belong to have an in-neighbour in . A locating set is a set of verti…
cs.DM2021
Close relatives (of Feedback Vertex Set), revisited
Hugo Jacob, Thomas Bellitto, Oscar Defrain +1
At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a number of problems related to the classic Feedback Vertex Set (FVS) problem do not admit a $2^{o(k \log k)} \cdo…