Parameterized Algorithms for Directed Maximum Leaf Problems

Details Parameterized Algorithms for Directed Maximum Leaf Problems Parameterized Algorithms for Directed Maximum Leaf Problems

2007-02-08

arxiv.org/abs/cs/0702049v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 $\cal L$ that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in $\cal 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\in \cal 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.

Affiliated with

Also associated with

No associations

Rating

Parameterized Algorithms for Directed Maximum Leaf Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parameterized Algorithms for Directed Maximum Leaf Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Algorithms for Directed Maximum Leaf Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432693