Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

An out-tree $T$ is an oriented tree with only one vertex of in-degree zero. A vertex $x$ of $T$ is internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a given out-tree with $k$ vertices. The algorithms are of runtime $O^*(5.704^k)$ and $O^*(5.704^{k(1+o(1))})$, respectively. We apply the deterministic algorithm to obtain a deterministic algorithm of runtime $O^*(c^k)$, where $c$ is a constant, for deciding whether an input digraph contains a spanning out-tree with at least $k$ internal vertices. This answers in affirmative a question of Gutin, Razgon and Kim (Proc. AAIM'08).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching 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 Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-115079

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.