Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of P4-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parametrized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problems. For the cograph vertex deletion problem, a refined analysis of the runtime of our simple bounded search algorithm gives a faster exponential factor than those algorithms designed with the help of complicated case distinctions and non-trivial running time analysis [R. Niedermeier and P. Rossmanith, An efficient fixed-parameter algorithm for 3-hitting set, J. Discrete Algorithms1(1) (...

[1]  Michel Habib,et al.  A New Linear Algorithm for Modular Decomposition , 1994, CAAP.

[2]  Jeremy P. Spinrad,et al.  Between O(nm) and O(nalpha) , 2003, SIAM J. Comput..

[3]  Mihalis Yannakakis,et al.  The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems , 1979, JACM.

[4]  Haim Kaplan,et al.  Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs , 1999, SIAM J. Comput..

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

[6]  Daniel Meister.  Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time , 2005, WG.

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

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

[9]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[10]  Gerard J. Chang,et al.  Quasi-threshold Graphs , 1996, Discret. Appl. Math..

[11]  Vassilis Giakoumakis,et al.  On Extended P4-Reducible and Extended P4-Sparse Graphs , 1997, Theor. Comput. Sci..

[12]  Ton Kloks,et al.  A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs , 2000, Discret. Appl. Math..

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

[14]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

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

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

[17]  Charis Papadopoulos,et al.  Characterizing and computing minimal cograph completions , 2010, Discret. Appl. Math..

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