A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Close relatives (of Feedback Vertex Set), revisited
[article]

2021
*
arXiv
*
pre-print

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)· n^𝒪(1)-time algorithm on graphs of treewidth at most k, assuming the Exponential Time Hypothesis. This contrasts with the 3^k· k^𝒪(1)· n-time algorithm for FVS using the Cut Count technique. During their live talk at IPEC 2020, Bergougnoux et al. posed a number of open questions, which we answer in this work. - Subset Even

arXiv:2106.16015v1
fatcat:7zb56fhkfrfa3nl4bngr2phxwe