An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion

07/02/2021
by   Faisal N. Abu-Khzam, et al.
0

A 2-club is a graph of diameter at most two. In the decision version of the parametrized 2-Club Cluster Edge Deletion problem, an undirected graph G is given along with an integer k≥ 0 as parameter, and the question is whether G can be transformed into a disjoint union of 2-clubs by deleting at most k edges. A simple fixed-parameter algorithm solves the problem in 𝒪^*(3^k), and a decade-old algorithm was claimed to have an improved running time of 𝒪^*(2.74^k) via a sophisticated case analysis. Unfortunately, this latter algorithm suffers from a flawed branching scenario. In this paper, an improved fixed-parameter algorithm is presented with a running time in 𝒪^*(2.695^k).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2019

Cluster deletion revisited

In the Cluster Deletion problem the input is a graph G and an integer k,...
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
11/12/2018

Tractability of Konig Edge Deletion Problems

A graph is said to be a Konig graph if the size of its maximum matching ...
research
08/21/2020

Deletion to Induced Matching

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

An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions

Spanners have been shown to be a powerful tool in graph algorithms. Many...
research
04/19/2022

A Fixed-Parameter Algorithm for the Schrijver Problem

The Schrijver graph S(n,k) is defined for integers n and k with n ≥ 2k a...
research
06/26/2020

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

Editing a graph into a disjoint union of clusters is a standard optimiza...

Please sign up or login with your details

Forgot password? Click here to reset