The Cluster Editing Problem: Implementations and Experiments

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 (rekemelization). We also observe an interesting lack of monotonicity in the running times for yes instances with increasing values of k.

[1]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[2]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[3]  Nagiza F. Samatova,et al.  Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[4]  Peter Damaschke.  Fixed-Parameter Tractable Generalizations of Cluster Editing , 2006, CIAC.

[5]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.

[6]  Jörg Rothe,et al.  Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP , 2001, RAIRO Theor. Informatics Appl..

[7]  Jiong Guo,et al.  Algorithm design techniques for parameterized graph modification problems , 2006, Ausgezeichnete Informatikdissertationen.

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[9]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Faisal N. Abu-Khzam,et al.  Scalable Parallel Algorithms for FPT Problems , 2006, Algorithmica.

[11]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[12]  Peter Damaschke.  On the Fixed-Parameter Enumerability of Cluster Editing , 2005, WG.