Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

by   Benjamin Bergougnoux, et al.

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 connected versions of the classical graph problems (such as Vertex Cover and Dominating Set). We show that Subset Feedback Vertex Set, Subset Odd Cycle Transversal, Restricted Edge-Subset Feedback Edge Set, Node Multiway Cut, and Multiway Cut are unlikely to have such running times. More precisely, we match algorithms running in time 2^O(tw log tw)n^O(1) with tight lower bounds under the Exponential-Time Hypothesis (ETH), ruling out 2^o(tw log tw)n^O(1), where n is the number of vertices and tw is the treewidth of the input graph. Our algorithms extend to the weighted case, while our lower bounds also hold for the larger parameter pathwidth and do not require weights. We also show that, in contrast to Odd Cycle Transversal, there is no 2^o(tw log tw)n^O(1)-time algorithm for Even Cycle Transversal under the ETH.



There are no comments yet.


page 13


Close relatives (of Feedback Vertex Set), revisited

At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a numb...

Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

We design the first subexponential-time (parameterized) algorithms for s...

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

We study the fine-grained complexity of counting the number of colorings...

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...

Exploiting Treewidth for Projected Model Counting and its Limits

In this paper, we introduce a novel algorithm to solve projected model c...

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds

We prove that the Hadwiger number of an n-vertex graph G (the maximum si...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.