Exact algorithms for cluster editing: Evaluation and experiments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A cutting plane algorithm for a clustering problem
- A more effective linear kernelization for cluster editing
- A simple min-cut algorithm
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Clustering of microarray data via clique partitioning
- Clustering with qualitative information
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- NP-hard problems in hierarchical-tree clustering
- On the partial order polytope of a digraph
- The Cluster Editing Problem: Implementations and Experiments
Cited in
(35)- Efficient algorithms for cluster editing
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Dominator coloring and CD coloring in almost cluster graphs
- Cluster editing with locally bounded modifications
- On making directed graphs transitive
- On the complexity of multi-parameterized cluster editing
- Branch-and-price for \(p\)-cluster editing
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- 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
- Cluster editing
- A golden ratio parameterized algorithm for cluster editing
- The branch and cut method for the clique partitioning problem
- 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
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Complexity of modification problems for reciprocal best match graphs
- Sufficient conditions for edit-optimal clusters
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
- 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
- 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)
