Elsevier

Journal of Discrete Algorithms

Volume 15, August 2012, Pages 43-55
Journal of Discrete Algorithms

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

https://doi.org/10.1016/j.jda.2012.03.006Get rights and content
Under an Elsevier user license
open archive

Abstract

Given a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree with as many leaves as possible. By designing a branching algorithm analyzed with Measure&Conquer, we show that the problem can be solved in time O(1.9044n) using polynomial space. Allowing exponential space, this run time upper bound can be lowered to O(1.8139n). We also provide an example showing a lower-bound for the running time of our algorithm.

Keywords

Exact exponential-time algorithms
NP-hard problems on directed graphs
Outbranching with a maximum number of leaves

Cited by (0)

An extended abstract appeared in Binkele-Raible and Fernau (2010) [1].