Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
published by \\'Edouard Bonnet
in 2020
in Informatics Engineering
and research's language is
English
Download
Abstract in English
The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time $2^{O(tw)}n^{O(1)}$, for Feedback Vertex Set and connect