D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract )

We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family L that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in L. Our algorithms are based on the following combinatorial result which can be viewed as a generalization of many results for a ‘spanning tree with many leaves’ in the undirected case, and which is interesting on its own: If a digraph D ∈ L of order n with minimum in-degree at least 3 contains a rooted spanning tree, then D contains one with at least (n/2) − 1 leaves.

[1]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[2]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

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

[4]  Francesco Maffioli,et al.  On the Approximability of Some Maximum Spanning Tree Problems , 1997, Theor. Comput. Sci..

[5]  Gerhard J. Woeginger,et al.  A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.

[6]  Francesco Maffioli,et al.  A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[7]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[8]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  P. Seymour,et al.  Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[11]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[12]  G. Gutin,et al.  The radii of n-partite tournaments , 1986 .

[13]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[14]  Jerrold R. Griggs,et al.  Spanning trees in graphs of minimum degree 4 or 5 , 1992, Discret. Math..

[15]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[16]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[17]  Paul D. Seymour,et al.  Spanning trees with many leaves , 2001, J. Graph Theory.

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

[19]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests and Depth First Search , 1989, WADS.

[20]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[21]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[22]  Rolf H. Möhring,et al.  Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .

[23]  Carsten Thomassen,et al.  Kings in k-partite tournaments , 1991, Discret. Math..

[24]  Private Communications , 2001 .

[25]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

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

[27]  Gregory Gutin,et al.  Some Parameterized Problems On Digraphs , 2008, Comput. J..

[28]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[29]  Michael R. Fellows,et al.  Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems , 2000, FSTTCS.

[30]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..