Cluster deletion revisited

DOI10.1016/j.ipl.2021.106171zbMath1476.05191arXiv1907.08399OpenAlexW3185869980MaRDI QIDQ2234801

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

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

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

Related Items (2)

Structural parameterization of cluster deletion ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules

Cites Work

• Graph-modeled data clustering: Exact algorithms for clique generation
• Automated generation of search tree algorithms for hard graphs modification problems
• Even faster parameterized cluster deletion and cluster editing
• Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

This page was built for publication: Cluster deletion revisited