FPT Algorithms and Kernels for the Directed $k$-Leaf Problem

Details FPT Algorithms and Kernels for the Directed $k$-Leaf Problem FPT Algorithms and Kernels for the Directed $k$-Leaf Problem

2008-10-27

arxiv.org/abs/0810.4946v3

Computer Science

Data Structures and Algorithms

Scientific paper

A subgraph $T$ of a digraph $D$ is an {\em out-branching} if $T$ is an oriented spanning tree with only one vertex of in-degree zero (called the {\em root}). The vertices of $T$ of out-degree zero are {\em leaves}. In the {\sc Directed $k$-Leaf} Problem, we are given a digraph $D$ and an integral parameter $k$, and we are to decide whether $D$ has an out-branching with at least $k$ leaves. Recently, Kneis et al. (2008) obtained an algorithm for the problem of running time $4^{k}\cdot n^{O(1)}$. We describe a new algorithm for the problem of running time $3.72^{k}\cdot n^{O(1)}$. In {\sc Rooted Directed $k$-Leaf} Problem, apart from $D$ and $k$, we are given a vertex $r$ of $D$ and we are to decide whether $D$ has an out-branching rooted at $r$ with at least $k$ leaves. Very recently, Fernau et al. (2008) found an $O(k^3)$-size kernel for {\sc Rooted Directed $k$-Leaf}. In this paper, we obtain an $O(k)$ kernel for {\sc Rooted Directed $k$-Leaf} restricted to acyclic digraphs.

Affiliated with

Also associated with

No associations

Rating

FPT Algorithms and Kernels for the Directed $k$-Leaf Problem 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 FPT Algorithms and Kernels for the Directed $k$-Leaf Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FPT Algorithms and Kernels for the Directed $k$-Leaf Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484923