# Cluster deletion revisited

## TL;DR

This paper presents a new fixed-parameter algorithm for the Cluster Deletion problem, improving the computational efficiency for determining minimal edge removals to form a cluster graph.

## Contribution

The authors develop an algorithm with a running time of O*(1.404^k) for the Cluster Deletion problem, enhancing previous methods.

## Key findings

- Algorithm runs in O*(1.404^k) time
- Improves efficiency over previous algorithms
- Advances fixed-parameter tractability for Cluster Deletion

## Abstract

In the Cluster 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 in which every connected component is a clique. In this paper we give an algorithm for Cluster Deletion whose running time is $O^*(1.404^k)$.