Cluster editing
From MaRDI portal
Recommendations
Cites work
- \textsc{Multicut} is FPT
- A 2k kernel for the cluster editing problem
- A cutting plane algorithm for a clustering problem
- A golden ratio parameterized algorithm for cluster editing
- A more effective linear kernelization for cluster editing
- A Note on Approximating Symmetric Relations by Equivalence Relations
- Aggregating inconsistent information: ranking and clustering
- Alternative parameterizations for cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- Approximating Symmetric Relations by Equivalence Relations
- Automated generation of search tree algorithms for hard graphs modification problems
- Bounded-degree techniques accelerate some parameterized graph algorithms
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Cluster editing with locally bounded modifications
- Cluster editing: kernelization based on edge cuts
- Cluster graph modification problems
- Clustering of microarray data via clique partitioning
- Clustering with qualitative information
- Correlation clustering
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Efficient Parameterized Preprocessing for Cluster Editing
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- Even faster parameterized cluster deletion and cluster editing
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Exact algorithms for cluster editing: Evaluation and experiments
- Extension and robustness of transitivity clustering for protein-protein interaction network analysis
- Fixed-parameter enumerability of cluster editing and related problems
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- Going weighted: parameterized algorithms for cluster editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 3717087 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 3797446 (Why is no real title available?)
- NP-hard problems in hierarchical-tree clustering
- On best transitive approximations to simple graphs
- On making directed graphs transitive
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Tight bounds for parameterized complexity of Cluster Editing
- Which problems have strongly exponential complexity?
Cited in
(36)- Cluster editing with vertex splitting
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Branch-and-price for \(p\)-cluster editing
- Polyhedral properties of the induced cluster subgraphs
- The biclique partitioning polytope
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Linear-time minimal cograph editing
- A new temporal interpretation of cluster editing
- Parameterized dynamic cluster editing
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A fast branching algorithm for cluster vertex deletion
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Hybrid metaheuristic for bicluster editing problem
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- scientific article; zbMATH DE number 764383 (Why is no real title available?)
- A faster algorithm for the cluster editing problem on proper interval graphs
- Destroying Bicolored $P_3$s by Deleting Few Edges
- Branch-and-cut approaches for p-cluster editing
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Parameterized Dynamic Cluster Editing
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Exact algorithms for cluster editing: Evaluation and experiments
- Efficient algorithms for cluster editing
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- A survey of parameterized algorithms and the complexity of edge modification
- Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
- A new temporal interpretation of cluster editing
- Cluster editing for multi-layer and temporal graphs
- When can cluster deletion with bounded weights be solved efficiently?
- A fixed-parameter branching algorithm for chromatic correlation clustering
- Applying a cut-based data reduction rule for weighted cluster editing in polynomial time
- Exact and heuristic solution approaches for the cluster deletion problem on general graphs
- Cluster editing parameterized above modification-disjoint P₃-packings
- Cluster editing parameterized above modification-disjoint P₃-Packings
- When can cluster deletion with bounded weights be solved efficiently?
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
This page was built for publication: Cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326357)
