Cograph Editing: Complexity and Parameterized Algorithms

Cograph Editing is to find for a given graph G = (V, E) a set of at most k edge additions and deletions that transform G into a cograph. The computational complexity of this problem was open in the past. In this paper, we show that this problem is NP-hard, and present a parameterized algorithm based on a refined search tree technique with a running time of O(4.612k+|V|4.5)), which improves the trivial algorithm of running time O(6k + |V|4.5).

[1]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[2]  Charis Papadopoulos,et al.  An optimal parallel solution for the path cover problem on P4-sparse graphs , 2007, J. Parallel Distributed Comput..

[3]  Flavia Bonomo,et al.  NP-completeness results for edge modification problems , 2006, Discret. Appl. Math..

[4]  Yong Zhang,et al.  Improved Algorithms for Bicluster Editing , 2008, TAMC.

[5]  Roded Sharan,et al.  Complexity classification of some edge modification problems , 1999, Discret. Appl. Math..

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

[7]  Jianer Chen,et al.  A 2k kernel for the cluster editing problem , 2012, J. Comput. Syst. Sci..

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

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

[10]  Yong Gao,et al.  A Novel Branching Strategy for Parameterized Graph Modification Problems , 2010, COCOA.

[11]  Christophe Paul,et al.  On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems , 2010, Algorithmica.

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

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

[14]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[15]  Stephan Olariu,et al.  Recognizing P_4 Sparse Graphs in Linear Time , 1992, SIAM J. Comput..

[16]  Charles J. Colbourn,et al.  The complexity of some edge deletion problems , 1988 .

[17]  Federico Mancini,et al.  Graph modification problems related to graph classes , 2008 .

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

[19]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .