Close relatives (of Feedback Vertex Set), revisited

by   Hugo Jacob, et al.

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 Cycle Transversal, Subset Odd Cycle Transversal, Subset Feedback Vertex Set can be solved in time 2^π’ͺ(k log k)Β· n in graphs of treewidth at most k. This matches a lower bound for Even Cycle Transversal of Bergougnoux et al.Β and improves the polynomial factor in some of their upper bounds. - Subset Feedback Vertex Set and Node Multiway Cut can be solved in time 2^π’ͺ(k log k)Β· n, if the input graph is given as a clique-width expression of size n and width k. - Odd Cycle Transversal can be solved in time 4^k Β· k^π’ͺ(1)Β· n if the input graph is given as a clique-width expression of size n and width k. Furthermore, the existence of a constant Ξ΅ > 0 and an algorithm performing this task in time (4-Ξ΅)^k Β· n^π’ͺ(1) would contradict the Strong Exponential Time Hypothesis.



There are no comments yet.


page 1

page 2

page 3

page 4

βˆ™ 07/28/2020

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

The Cut Count technique and the rank-based approach have lead to sin...
βˆ™ 11/17/2020

Optimal diameter computation within bounded clique-width graphs

Coudert et al. (SODA'18) proved that under the Strong Exponential-Time H...
βˆ™ 03/02/2018

An improved FPT algorithm for Independent Feedback Vertex Set

We study the Independent Feedback Vertex Set problem - a variant of the ...
βˆ™ 06/28/2019

Detecting Feedback Vertex Sets of Size k in O^(2.7^k) Time

In the Feedback Vertex Set problem, one is given an undirected graph G a...
βˆ™ 03/02/2020

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs

We present an algorithm for the extensively studied Long Path and Long C...
βˆ™ 01/15/2020

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...
βˆ™ 07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...
This week in AI

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