
Faster algorithm for Cograph Deletion
In the Cograph Deletion problem the input is a graph G and an integer k,...
read it

An algorithm for destroying claws and diamonds
In the Claw,DiamondFree Edge Deletion problem the input is a graph G an...
read it

Cluster deletion revisited
In the Cluster Deletion problem the input is a graph G and an integer k,...
read it

Database Matching Under Column Deletions
Deanonymizing user identities by matching various forms of user data av...
read it

An Improved FixedParameter Algorithm for 2Club Cluster Edge Deletion
A 2club is a graph of diameter at most two. In the decision version of ...
read it

Improved FPT Algorithms for Deletion to Forestlike Structures
The Feedback Vertex Set problem is undoubtedly one of the most wellstud...
read it

An Experimental Study of Permanently Stored Learned Clauses
Modern CDCL SAT solvers learn clauses rapidly, and an important heuristi...
read it
Deletion to Induced Matching
In the DELETION TO INDUCED MATCHING problem, we are given a graph G on n vertices, m edges and a nonnegative integer k and asks whether there exists a set of vertices S ⊆ V(G) such that S≤ k and the size of any connected component in GS is exactly 2. In this paper, we provide a fixedparameter tractable (FPT) algorithm of running time O^*(1.748^k) for the DELETION TO INDUCED MATCHING problem using branchandreduce strategy and path decomposition. We also extend our work to the exactexponential version of the problem.
READ FULL TEXT
Comments
There are no comments yet.