The cluster editing problem: implementations and experiments

Authors:
Frank Dehne;Michael A. Langston;Xuemei Luo;Sylvain Pitre;Peter Shaw;Yun Zhang
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;Department of Computer Science, University of Tennessee, Knoxville, TN;School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;Department of Computer Science, University of Newcastle, Newcastle, Australia;Department of Computer Science, University of Tennessee, Knoxville, TN
Venue:
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Year:
2006

Citing 8
Cited 24

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

Theory of Computing Systems
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Clustering with qualitative information

Journal of Computer and System Sciences - Special issue: Learning theory 2003
Scalable Parallel Algorithms for FPT Problems

Algorithmica
Fixed-parameter tractable generalizations of cluster editing

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the fixed-parameter enumerability of cluster editing

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Clustering with Partial Information

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Iterative Compression and Exact Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Going Weighted: Parameterized Algorithms for Cluster Editing

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Parameterized Graph Editing with Chosen Vertex Degrees

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Graph-Based Data Clustering with Overlaps

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Going weighted: Parameterized algorithms for cluster editing

Theoretical Computer Science
Editing Graphs into Disjoint Unions of Dense Clusters

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Iterative compression and exact algorithms

Theoretical Computer Science
Exact algorithms for cluster editing: evaluation and experiments

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Improved algorithms for bicluster editing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Polynomial kernels for 3-leaf power graph modification problems

Discrete Applied Mathematics
A 2k Kernel for the cluster editing problem

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Generalized graph clustering: recognizing (p, q)-cluster graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Alternative parameterizations for cluster editing

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Even faster parameterized cluster deletion and cluster editing

Information Processing Letters
A systematic comparison of genome scale clustering algorithms

ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
A 2k kernel for the cluster editing problem

Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing

SIAM Journal on Discrete Mathematics
Graph-based data clustering with overlaps

Discrete Optimization
Efficient parameterized preprocessing for cluster editing

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A more effective linear kernelization for Cluster Editing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A simple 3-edge connected component algorithm revisited

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the cluster editing problem which is fixed parameter tractable. We present the first practical implementation of a FPT based method for cluster editing, using the approach in [6,7], and compare our implementation with the straightforward greedy method and a solution based on linear programming [3]. Our experiments show that the best results are obtained by using the refined branching method in [7] together with interleaving (re-kernelization). We also observe an interesting lack of monotonicity in the running times for “yes” instances with increasing values of k.