Destroying Bicolored P_3s by Deleting Few Edges

01/11/2019
by   Niels Grüttemeier, et al.
0

We introduce and study the Bicolored P_3 Deletion problem defined as follows. The input is a graph G=(V,E) where the edge set E is partitioned into a set E_b of blue edges and a set E_r of red edges. The question is whether we can delete at most k edges such that G does not contain a bicolored P_3 as an induced subgraph. Here, a bicolored P_3 is a path on three vertices with one blue and one red edge. We show that Bicolored P_3 Deletion is NP-hard and cannot be solved in 2^o(|V|+|E|) time on bounded-degree graphs if the ETH is true. Then, we show that Bicolored P_3 Deletion is polynomial-time solvable when G does not contain a bicolored K_3, that is, a triangle with edges of both colors. Moreover, we provide a polynomial-time algorithm for the case if G contains no blue P_3, red P_3, blue K_3, and red K_3. Finally, we show that Bicolored P_3 Deletion can be solved in O(1.85^k· |V|^5) time and that it admits a kernel with O(Δ k^2) vertices, where Δ is the maximum degree of G.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2019

Faster algorithm for Cograph Deletion

In the Cograph Deletion problem the input is a graph G and an integer k,...
research
04/07/2021

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

We study the computational complexity of c-Colored P_ℓ Deletion and c-Co...
research
07/12/2021

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws

For graphs G and H, we say that G is H-free if it does not contain H as ...
research
11/15/2022

The RED-BLUE SEPARATION problem on graphs

We introduce the Red-Blue Separation problem on graphs, where we are giv...
research
11/11/2019

A polynomial kernel for 3-leaf power deletion

A graph G is an ℓ-leaf power of a tree T if V(G) is equal to the set of ...
research
02/28/2018

Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...
research
07/04/2012

On Bayesian Network Approximation by Edge Deletion

We consider the problem of deleting edges from a Bayesian network for th...

Please sign up or login with your details

Forgot password? Click here to reset