Exact algorithms for cluster editing: Evaluation and experiments

computer experiments ILP integer linear programming fixed-parameter tractability NP-complete problem FPT branch-and-cut algorithm algorithm engineering cluster editing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Integer programming (90C10)

Recommendations

Exact Algorithms for Cluster Editing: Evaluation and Experiments
Efficient algorithms for cluster editing
Graph-modeled data clustering: Exact algorithms for clique generation
Cluster editing
Alternative parameterizations for cluster editing

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)

Cluster editing
Graph-modeled data clustering: Exact algorithms for clique generation
A faster algorithm for the cluster editing problem on proper interval graphs
Parameterized algorithms for module map problems
Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
On the complexity of multi-parameterized cluster editing
The biclique partitioning polytope
On 2-clubs in graph-based data clustering: theory and algorithm engineering
Tight bounds for parameterized complexity of Cluster Editing
On 2-clubs in graph-based data clustering: theory and algorithm engineering
Going Weighted: Parameterized Algorithms for Cluster Editing
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
\texttt{CP-Lib}: benchmark instances of the clique partitioning problem
Complexity of modification problems for reciprocal best match graphs
On making directed graphs transitive
The Multi-parameterized Cluster Editing Problem
Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
Sufficient conditions for edit-optimal clusters
\((1,1)\)-cluster editing is polynomial-time solvable
Best match graphs and reconciliation of gene trees with species trees
Automated generation of search tree algorithms for hard graphs modification problems
The branch and cut method for the clique partitioning problem
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
Graph-Theoretic Concepts in Computer Science
Linear-time minimal cograph editing
Dominator coloring and CD coloring in almost cluster graphs
Even better fixed-parameter algorithms for bicluster editing
A golden ratio parameterized algorithm for cluster editing
The Cluster Editing Problem: Implementations and Experiments
scientific article; zbMATH DE number 7651198 (Why is no real title available?)
Branch-and-cut approaches for \(p\)-cluster editing
Efficient algorithms for cluster editing
Exact Algorithms for Cluster Editing: Evaluation and Experiments
Cluster editing with locally bounded modifications
Branch-and-price for \(p\)-cluster editing

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)