Improved parameterized algorithms for cluster vertex deletion

DOI10.1007/S00224-025-10247-6MaRDI QIDQ6879184zbMATH OpenFDO

Authors Kangyi Tian, Mingyu Xiao, Boting Yang

Publication date 2 January 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-025-10247-6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A fast branching algorithm for cluster vertex deletion
• A golden ratio parameterized algorithm for cluster editing
• Automated generation of search tree algorithms for hard graphs modification problems
• Bounded-degree techniques accelerate some parameterized graph algorithms
• Cluster deletion revisited
• Correlation clustering
• Exact algorithms via monotone local search
• Faster parameterized algorithm for cluster vertex deletion
• Fixed-parameter algorithms for cluster vertex deletion
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Going weighted: parameterized algorithms for cluster editing
• Graph-modeled data clustering: Exact algorithms for clique generation
• Parameterized algorithm for 3-path vertex cover
• Parameterized algorithms
• Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs

This page was built for publication: Improved parameterized algorithms for cluster vertex deletion

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