Treewidth Parameterized by Feedback Vertex Number

Hendrik Molter, Meirav Zehavi, Amit Zivan

We provide the first algorithm for computing an optimal tree decomposition for a given graph $G$ that runs in single exponential time in the feedback vertex number of $G$, that is,…