Exact algorithms for cluster editing: Evaluation and experiments
DOI10.1007/S00453-009-9339-7zbMATH Open1215.68169OpenAlexW2137745608MaRDI QIDQ534775FDOQ534775
Gunnar W. Klau, Sebastian Briesemeister, Sebastian Böcker
Publication date: 10 May 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/14843
Recommendations
computer experimentsILPinteger linear programmingfixed-parameter tractabilityNP-complete problemFPTbranch-and-cut algorithmalgorithm engineeringcluster editing
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Integer programming (90C10)
Cites Work
- Automated generation of search tree algorithms for hard graphs modification problems
- Clustering with qualitative information
- Title not available (Why is that?)
- Clustering of microarray data via clique partitioning
- A cutting plane algorithm for a clustering problem
- On the partial order polytope of a digraph
- Cluster graph modification problems
- A simple min-cut algorithm
- A more effective linear kernelization for cluster editing
- NP-hard problems in hierarchical-tree clustering
- The Cluster Editing Problem: Implementations and Experiments
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Graph-modeled data clustering: Exact algorithms for clique generation
- Going Weighted: Parameterized Algorithms for Cluster Editing
Cited In (32)
- The Branch and Cut Method for the Clique Partitioning Problem
- Cluster Editing
- Dominator coloring and CD coloring in almost cluster graphs
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Cluster editing with locally bounded modifications
- On the complexity of multi-parameterized cluster editing
- On making directed graphs transitive
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- Branch-and-price for \(p\)-cluster editing
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Graph-modeled data clustering: Exact algorithms for clique generation
- Even better fixed-parameter algorithms for bicluster editing
- Tight bounds for parameterized complexity of Cluster Editing
- Best match graphs and reconciliation of gene trees with species trees
- The Multi-parameterized Cluster Editing Problem
- Automated generation of search tree algorithms for hard graphs modification problems
- A golden ratio parameterized algorithm for cluster editing
- The biclique partitioning polytope
- Graph-Theoretic Concepts in Computer Science
- \((1,1)\)-cluster editing is polynomial-time solvable
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Complexity of modification problems for reciprocal best match graphs
- Sufficient conditions for edit-optimal clusters
- Title not available (Why is that?)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
- A faster algorithm for the cluster editing problem on proper interval graphs
- Branch-and-cut approaches for \(p\)-cluster editing
- Parameterized algorithms for module map problems
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
- The Cluster Editing Problem: Implementations and Experiments
- Linear-time minimal cograph editing
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
This page was built for publication: Exact algorithms for cluster editing: Evaluation and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534775)
