Width Parameterizations for Knot-free Vertex Deletion on Digraphs

10/04/2019
by   Stéphane Bessy, et al.
0

A knot in a directed graph G is a strongly connected subgraph Q of G with at least two vertices, such that no vertex in V(Q) is an in-neighbor of a vertex in V(G)∖ V(Q). Knots are important graph structures, because they characterize the existence of deadlocks in a classical distributed computation model, the so-called OR-model. Deadlock detection is correlated with the recognition of knot-free graphs as well as deadlock resolution is closely related to the Knot-Free Vertex Deletion (KFVD) problem, which consists of determining whether an input graph G has a subset S ⊆ V(G) of size at most k such that G[V∖ S] contains no knot. In this paper we focus on graph width measure parameterizations for KFVD. First, we show that: (i) KFVD parameterized by the size of the solution k is W[1]-hard even when p, the length of a longest directed path of the input graph, as well as κ, its Kenny-width, are bounded by constants, and we remark that KFVD is para-NP-hard even considering many directed width measures as parameters, but in FPT when parameterized by clique-width; (ii) KFVD can be solved in time 2^O(tw)× n, but assuming ETH it cannot be solved in 2^o(tw)× n^O(1), where tw is the treewidth of the underlying undirected graph. Finally, since the size of a minimum directed feedback vertex set (dfv) is an upper bound for the size of a minimum knot-free vertex deletion set, we investigate parameterization by dfv and we show that (iii) KFVD can be solved in FPT-time parameterized by either dfv+κ or dfv+p; and it admits a Turing kernel by the distance to a DAG having an Hamiltonian path.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2019

A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion

For a fixed finite family of graphs F, the F-Minor-Free Deletion problem...
research
03/20/2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion

A knot K in a directed graph D is a strongly connected component of size...
research
05/30/2019

Parametrised Algorithms for Directed Modular Width

Many well-known NP-hard algorithmic problems on directed graphs resist e...
research
12/08/2021

Twin-Distance-Hereditary Digraphs

We investigate structural and algorithmic advantages of a directed versi...
research
11/14/2017

A note on the complexity of Feedback Vertex Set parameterized by mim-width

We complement the recent algorithmic result that Feedback Vertex Set is ...
research
03/17/2021

Vertex Deletion Parameterized by Elimination Distance and Even Less

We study the parameterized complexity of various classic vertex deletion...
research
08/11/2023

Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large

We study the parameterized complexity of two classic problems on directe...

Please sign up or login with your details

Forgot password? Click here to reset