Parameterized algorithms for min-max 2-cluster editing
From MaRDI portal
Publication:2410027
DOI10.1007/s10878-016-0059-zzbMath1378.05197OpenAlexW2475758475MaRDI QIDQ2410027
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0059-z
clusteringrandomized algorithmparameterized complexitysubexponential algorithmparameterized algorithmgraph modification
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- A \(2k\) kernel for the cluster editing problem
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- Graph-based data clustering with overlaps
- Graph clustering
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Correlation clustering
- Cluster editing with locally bounded modifications
- Graph-modeled data clustering: Exact algorithms for clique generation
- Sufficient conditions for edit-optimal clusters
- On the approximation of correlation clustering and consensus clustering
- Fixed-parameter enumerability of cluster editing and related problems
- Fixed-parameter algorithms for cluster vertex deletion
- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- On the notion of balance of a signed graph
- On the Clique Editing Problem
- Editing Simple Graphs
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- Data Integration in the Life Sciences
- Aggregating inconsistent information
This page was built for publication: Parameterized algorithms for min-max 2-cluster editing
