An improved parameterized algorithm for the p-cluster vertex deletion problem

DOI10.1007/S10878-015-9969-4MaRDI QIDQ511682zbMATH OpenOpenAlexFDO

Authors Bang Ye Wu, Li-Hsuan Chen

Publication date 22 February 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9969-4

zbMATH Keywords

cluster graphexact algorithmgraph modificationparameterized algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Faster parameterized algorithm for cluster vertex deletion
• A fast branching algorithm for cluster vertex deletion
• A fast branching algorithm for cluster vertex deletion
• Cluster deletion revisited
• Fixed-parameter algorithms for cluster vertex deletion

Cites work

• A 2k kernel for the cluster editing problem
• A fast branching algorithm for cluster vertex deletion
• A general method to speed up fixed-parameter-tractable algorithms
• A kernelization algorithm for \(d\)-hitting set
• A measure \& conquer approach for the analysis of exact algorithms
• A more effective linear kernelization for cluster editing
• Automated generation of search tree algorithms for hard graphs modification problems
• Bounded-degree techniques accelerate some parameterized graph algorithms
• Cluster editing with locally bounded modifications
• Cluster graph modification problems
• Even faster parameterized cluster deletion and cluster editing
• Fixed-parameter algorithms for cluster vertex deletion
• Fixed-parameter enumerability of cluster editing and related problems
• Going weighted: parameterized algorithms for cluster editing
• Graph-based data clustering with overlaps
• Graph-modeled data clustering: Exact algorithms for clique generation
• Improved upper bounds for vertex cover
• Iterative compression and exact algorithms
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters

Cited in

(7)

• Faster parameterized algorithm for cluster vertex deletion
• A fast branching algorithm for cluster vertex deletion
• On the d-claw vertex deletion problem
• Cluster vertex deletion: a parameterization between vertex cover and clique-width
• Kernelization through Tidying
• A fast branching algorithm for cluster vertex deletion
• On the parameterized complexity of s-club cluster deletion problems

This page was built for publication: An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem

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