An improved parameterized algorithm for the p-cluster vertex deletion problem
From MaRDI portal
Publication:511682
DOI10.1007/S10878-015-9969-4zbMATH Open1361.90065OpenAlexW2501188539MaRDI QIDQ511682FDOQ511682
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
Cites Work
- Automated generation of search tree algorithms for hard graphs modification problems
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A measure & conquer approach for the analysis of exact algorithms
- A \(2k\) kernel for the cluster editing problem
- Cluster editing with locally bounded modifications
- Fixed-parameter algorithms for cluster vertex deletion
- A kernelization algorithm for \(d\)-hitting set
- Graph-based data clustering with overlaps
- Improved upper bounds for vertex cover
- Iterative compression and exact algorithms
- Cluster graph modification problems
- A more effective linear kernelization for cluster editing
- A general method to speed up fixed-parameter-tractable algorithms
- Even faster parameterized cluster deletion and cluster editing
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- Going weighted: parameterized algorithms for cluster editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter enumerability of cluster editing and related problems
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A Fast Branching Algorithm for Cluster Vertex Deletion
Cited In (4)
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)
