The Cluster Editing Problem: Implementations and Experiments
From MaRDI portal
Publication:3499720
DOI10.1007/11847250_2zbMATH Open1154.68451OpenAlexW1580304490MaRDI QIDQ3499720FDOQ3499720
Author name not available (Why is that?)
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_2
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cited In (43)
- Efficient algorithms for cluster editing
- Polynomial kernels for 3-leaf power graph modification problems
- A \(2k\) kernel for the cluster editing problem
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- A more effective linear kernelization for cluster editing
- Graph-Based Data Clustering with Overlaps
- Parameterized and Exact Computation
- Graph-based data clustering with overlaps
- Fixed-parameter algorithms for cluster vertex deletion
- Parameterized Graph Editing with Chosen Vertex Degrees
- Improved Algorithms for Bicluster Editing
- Exact algorithms for cluster editing: Evaluation and experiments
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Title not available (Why is that?)
- Branch-and-price for \(p\)-cluster editing
- Editing graphs into disjoint unions of dense clusters
- Bounded-degree techniques accelerate some parameterized graph algorithms
- Tight bounds for parameterized complexity of Cluster Editing
- Going weighted: parameterized algorithms for cluster editing
- A simple 3-edge connected component algorithm revisited
- The Multi-parameterized Cluster Editing Problem
- Even faster parameterized cluster deletion and cluster editing
- Polyhedral properties of the induced cluster subgraphs
- The maximum independent union of cliques problem: complexity and exact approaches
- On Editing Graphs into 2-Club Clusters
- 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
- On the threshold of intractability
- Fixed-parameter enumerability of cluster editing and related problems
- Clustering with Partial Information
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
- Alternative Parameterizations for Cluster Editing
- A simple certifying algorithm for 3-edge-connectivity
- Iterative Compression and Exact Algorithms
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Branch-and-cut approaches for \(p\)-cluster editing
- Certifying 3-edge-connectivity
- 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)
