The Cluster Editing Problem: Implementations and Experiments
From MaRDI portal
Recommendations
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Exact algorithms for cluster editing: Evaluation and experiments
- Alternative parameterizations for cluster editing
- Fixed-parameter enumerability of cluster editing and related problems
Cited in
(43)- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- Even faster parameterized cluster deletion and cluster editing
- Branch-and-price for \(p\)-cluster editing
- Polyhedral properties of the induced cluster subgraphs
- The maximum independent union of cliques problem: complexity and exact approaches
- Iterative compression and exact algorithms
- A simple 3-edge connected component algorithm revisited
- A simple certifying algorithm for 3-edge-connectivity
- The Multi-parameterized Cluster Editing Problem
- On Editing Graphs into 2-Club Clusters
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Tight bounds for parameterized complexity of Cluster Editing
- A PTAS for the Cluster Editing Problem on Planar Graphs
- Generalized graph clustering: recognizing (p,q)-cluster graphs
- Alternative parameterizations for cluster editing
- Improved Algorithms for Bicluster Editing
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Clustering with Partial Information
- Iterative Compression and Exact Algorithms
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Bounded-degree techniques accelerate some parameterized graph algorithms
- A 2k kernel for the cluster editing problem
- Graph-based data clustering with overlaps
- Branch-and-cut approaches for p-cluster editing
- A simple randomized 3-edge connected component algorithm
- Parameterized and Exact Computation
- Graph-Based Data Clustering with Overlaps
- Exact algorithms for cluster editing: Evaluation and experiments
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Parameterized Graph Editing with Chosen Vertex Degrees
- Graph-Theoretic Concepts in Computer Science
- Efficient algorithms for cluster editing
- Polynomial kernels for 3-leaf power graph modification problems
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- s-club cluster vertex deletion on interval and well-partitioned chordal graphs
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Editing graphs into disjoint unions of dense clusters
- A heuristic algorithm for the cluster editing problem
- Cluster editing with vertex splitting
- Fixed-parameter enumerability of cluster editing and related problems
- Fixed-parameter algorithms for cluster vertex deletion
This page was built for publication: The Cluster Editing Problem: Implementations and Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499720)
