Faster algorithm for Cograph Deletion

08/03/2019
by   Dekel Tsur, et al.
0

In the Cograph Deletion problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results a graph that does not contain an induced path with four vertices. In this paper we give an algorithm for Cograph Deletion whose running time is O^*(2.303^k).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2019

An algorithm for destroying claws and diamonds

In the Claw,Diamond-Free Edge Deletion problem the input is a graph G an...
research
08/03/2019

Faster algorithms for cograph edge modification problems

In the Cograph Deletion (resp., Cograph Editing) problem the input is a ...
research
08/21/2020

Deletion to Induced Matching

In the DELETION TO INDUCED MATCHING problem, we are given a graph G on n...
research
01/11/2019

Destroying Bicolored P_3s by Deleting Few Edges

We introduce and study the Bicolored P_3 Deletion problem defined as fol...
research
08/16/2021

Efficient Network Analysis Under Single Link Deletion

The problem of worst case edge deletion from a network is considered. Su...
research
01/15/2020

Insertion-Deletion Transformer

We propose the Insertion-Deletion Transformer, a novel transformer-based...
research
04/02/2023

Extended SPR for Evolving Networks with Nodes Preferential Deletion

Evolving networks are more widely existed in real world than static netw...

Please sign up or login with your details

Forgot password? Click here to reset