Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms

Édouard Bonnet, Nick Brettell, O-joung Kwon +1

It has long been known that Feedback Vertex Set can be solved in time $2^{\mathcal{O}(w\log w)}{n}^{\mathcal{O}(1)}$ on $n$-vertex graphs of treewidth $w$, but it was only recently t…