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