Fixed-Parameter Algorithms for Cluster Vertex Deletion

We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searches for a minimum number of vertex deletions to transform a graph into a collection of disjoint cliques. The parameter is the number of vertex deletions. We present efficient fixed-parameter algorithms for CVD applying the fairly new iterative compression technique. Moreover, we study the variant of CVD where the maximum number of cliques to be generated is prespecified. Here, we exploit connections to fixed-parameter algorithms for (weighted) Vertex Cover.

[1]  Mike Paterson,et al.  Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers , 2007, ESCAPE.

[2]  Klaus Jansen,et al.  The Disjoint Cliques Problem , 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[3]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings , 2006, MFCS.

[4]  Yun Zhang,et al.  The Cluster Editing Problem: Implementations and Experiments , 2006, IWPEC.

[5]  Xiaotie Deng,et al.  An Approximation Algorithm for Feedback Vertex Sets in Tournaments , 2001, SIAM J. Comput..

[6]  David P. Williamson,et al.  Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems , 2007, WAOA.

[7]  Michael R. Fellows,et al.  Efficient Parameterized Preprocessing for Cluster Editing , 2007, FCT.

[8]  Henning Fernau,et al.  Parameterized algorithms for d-Hitting Set: The weighted case , 2006, Theor. Comput. Sci..

[9]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[10]  Sebastian Böcker,et al.  Going weighted: Parameterized algorithms for cluster editing , 2009, Theor. Comput. Sci..

[11]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[12]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[13]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[14]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[15]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[16]  Sven Rahmann,et al.  Exact and heuristic algorithms for weighted cluster editing. , 2007, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[17]  Henning Fernau.  Parameterized algorithms for d-Hitting Set: The weighted case , 2010, Theor. Comput. Sci..

[18]  Henning Fernau,et al.  Kernels: Annotated, Proper and Induced , 2006, IWPEC.

[19]  Rolf Niedermeier,et al.  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems , 2004, Algorithmica.

[20]  Fedor V. Fomin,et al.  Iterative compression and exact algorithms , 2010, Theor. Comput. Sci..

[21]  Howard Straubing,et al.  Theory of Computing Systems , 2008 .

[22]  Venkatesan Guruswami,et al.  Correlation clustering with a fixed number of clusters , 2005, SODA '06.

[23]  Rolf Niedermeier,et al.  On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.

[24]  Jayme Luiz Szwarcfiter,et al.  Applying Modular Decomposition to Parameterized Cluster Editing Problems , 2008, Theory of Computing Systems.

[25]  Faisal N. Abu-Khzam.  Kernelization Algorithms for d-Hitting Set Problems , 2007, WADS.

[26]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[27]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[28]  P. Gács,et al.  Algorithms , 1992 .

[29]  Herbert S. Wilf,et al.  Algorithms and Complexity , 2010, Lecture Notes in Computer Science.

[30]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[31]  Roded Sharan,et al.  Cluster Graph Modification Problems , 2002, WG.

[32]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[33]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2010, J. Discrete Algorithms.

[34]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[35]  Jayme Luiz Szwarcfiter,et al.  Applying Modular Decomposition to Parameterized Bicluster Editing , 2006, IWPEC.

[36]  Rolf Niedermeier,et al.  Iterative Compression for Exactly Solving NP-Hard Minimization Problems , 2009, Algorithmics of Large and Complex Networks.

[37]  Sebastian Böcker,et al.  A Fixed-Parameter Approach for Weighted Cluster Editing , 2007, APBC.

[38]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[39]  Saket Saurabh,et al.  Parameterized algorithms for feedback set problems and their duals in tournaments , 2006, Theor. Comput. Sci..

[40]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[41]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[42]  Falk Hüffner,et al.  Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und ExperimenteAlgorithms and Experiments for Parameterized Approaches to Hard Graph Problems , 2009, it Inf. Technol..

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

[44]  Jiong Guo.  A more effective linear kernelization for cluster editing , 2009, Theor. Comput. Sci..

[45]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[46]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..