The Cluster Editing Problem: Implementations and Experiments

DOI10.1007/11847250_2zbMath1154.68451OpenAlexW1580304490MaRDI QIDQ3499720

No author found.

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Graph-Based Data Clustering with Overlaps ⋮ The maximum independent union of cliques problem: complexity and exact approaches ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ Improved Algorithms for Bicluster Editing ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ Exact Algorithms for Cluster Editing: Evaluation and Experiments ⋮ A \(2k\) kernel for the cluster editing problem ⋮ Even faster parameterized cluster deletion and cluster editing ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ Graph-based data clustering with overlaps ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Certifying 3-edge-connectivity ⋮ Exact algorithms for cluster editing: Evaluation and experiments ⋮ Fixed-parameter enumerability of cluster editing and related problems ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Iterative compression and exact algorithms ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Clustering with Partial Information ⋮ Iterative Compression and Exact Algorithms ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs ⋮ Efficient algorithms for cluster editing ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ A more effective linear kernelization for cluster editing ⋮ Alternative Parameterizations for Cluster Editing ⋮ On the threshold of intractability ⋮ Unnamed Item ⋮ Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms ⋮ Going weighted: parameterized algorithms for cluster editing ⋮ Going Weighted: Parameterized Algorithms for Cluster Editing ⋮ Parameterized Graph Editing with Chosen Vertex Degrees ⋮ A simple 3-edge connected component algorithm revisited