The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
On well-partial-order theory and its application to combinatorial problems of VLSI design
SIAM Journal on Discrete Mathematics
Kings in k-partite tournaments
Discrete Mathematics
The vertex separation number of a graph equals its path-width
Information Processing Letters
Spanning trees in graphs of minimum degree 4 or 5
Discrete Mathematics
On linear time minor tests with depth-first search
Journal of Algorithms
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the approximability of some maximum spanning tree problems
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Spanning trees with many leaves
Journal of Graph Theory
Parameterized Complexity
Some Parameterized Problems On Digraphs
The Computer Journal
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
Better algorithms and bounds for directed maximum leaf problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms (TALG)
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
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/5 - 1 leaves.