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 branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs. By using the class of P 4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems. For the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms. For the cograph vertex deletion problem, the running time of our simple bounded search algorithm matches those previously designed with the help of complicated case distinctions and non-trivial running time analysis [16] and computer-aided branching rules [7]. © 2010 Springer-Verlag.
CITATION STYLE
Nastos, J., & Gao, Y. (2010). A novel branching strategy for parameterized graph modification problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 332–346). https://doi.org/10.1007/978-3-642-17461-2_27
Mendeley helps you to discover research relevant for your work.