Computer Science – Data Structures and Algorithms
Scientific paper
2007-11-26
Computer Science
Data Structures and Algorithms
17 pages, 8 figures
Scientific paper
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of directed graphs. The main new ingredient in our approach is a lemma that shows that given a locally optimal out-branching of a directed graph in which every arc is part of at least one out-branching, either an out-branching with at least k leaves exists, or a path decomposition with width O(k^3) can be found. This enables a dynamic programming based algorithm of running time 2^{O(k^3 \log k)} n^{O(1)}, where n=|V(D)|.
Bonsma Paul
Dorn Frederic
No associations
LandOfFree
An FPT Algorithm for Directed Spanning k-Leaf 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 An FPT Algorithm for Directed Spanning k-Leaf, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An FPT Algorithm for Directed Spanning k-Leaf will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-170986