A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem

Details A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem

2009-11-10

arxiv.org/abs/0911.1900v2

Computer Science

Data Structures and Algorithms

Scientific paper

Given a directed graph $G=(V,A)$, the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree (i.e., an out-branching) with as many leaves as possible. By designing a Branch-and-Reduced algorithm combined with the Measure & Conquer technique for running time analysis, we show that the problem can be solved in time $\Oh^*(1.9043^n)$ using polynomial space. Hitherto, there have been only few examples. Provided exponential space this run time upper bound can be lowered to $\Oh^*(1.8139^n)$.

Affiliated with

Also associated with

No associations

Rating

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree 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 A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51434