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 . Our experiments show that the best results are obtained by using the refined branching method in  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.
|Title of host publication||IWPEC|
|Subtitle of host publication||International Workshop on Parameterized and Exact Computation|
|Editors||Hans L. Bodlaender, Michael A. Langston|
|Number of pages||12|
|Publication status||Published - 2006|
|Name||Lecture Notes in Computer Science|