Cluster deletion revisited

DOI10.1016/J.IPL.2021.106171MaRDI QIDQ2234801zbMATH OpenOpenAlexFDO

Authors Dekel Tsur

Publication date 19 October 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.08399

zbMATH Keywords

branching algorithmsgraph algorithmsparameterized complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

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^{\ast }(1.404^k)$.

Recommendations

• Faster parameterized algorithm for cluster vertex deletion
• Even faster parameterized cluster deletion and cluster editing
• scientific article; zbMATH DE number 2011849
• The cluster deletion problem for cographs
• Graph-modeled data clustering: Exact algorithms for clique generation

Cites work

• Automated generation of search tree algorithms for hard graphs modification problems
• Bounded-degree techniques accelerate some parameterized graph algorithms
• Even faster parameterized cluster deletion and cluster editing
• Graph-modeled data clustering: Exact algorithms for clique generation

Cited in

(26)

• Even faster parameterized cluster deletion and cluster editing
• Cluster deletion on interval graphs and split related graphs
• Subexponential algorithm for d-cluster edge deletion: exception or rule?
• A new approximate cluster deletion algorithm for diamond-free graphs
• A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
• Kernel for \(K_t\)\textsc-free Edge Deletion
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
• The cluster deletion problem for cographs
• Cluster deletion on interval graphs and split related graphs
• An improved parameterized algorithm for the p-cluster vertex deletion problem
• Graph-Theoretic Concepts in Computer Science
• A polynomial-time algorithm for cluster deletion on (diamond, Butterfly)-free graphs
• On the Parameterized Complexity of Clique Elimination Distance
• Structural parameterization of cluster deletion
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules
• Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
• Parameterized algorithms for editing to uniform cluster graph
• When can cluster deletion with bounded weights be solved efficiently?
• Improved parameterized algorithms for cluster vertex deletion
• Smaller kernels for 3-leaf power modifications problems
• Graph clustering problems under the Lens of parameterized local search
• Exact and heuristic solution approaches for the cluster deletion problem on general graphs
• Structural parameterization of cluster deletion
• Graph clustering problems under the Lens of parameterized local search
• When can cluster deletion with bounded weights be solved efficiently?
• Title not available (Why is no real title available?)

This page was built for publication: Cluster deletion revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234801)