A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
2012
Journal of Discrete Algorithms
NP-hard problems on directed graphs Outbranching with a maximum number of leaves 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.9044 n ) using polynomial space. Allowing exponential space, this run time upper bound can be lowered to O * (1.8139 n ). We also provide an
doi:10.1016/j.jda.2012.03.006
fatcat:uwa6o6dflfaifdmbpxb6s2detu