An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leaves k, this problem can be solved in time O(4k poly(n)) using a simple branching algorithm introduced by a subset of the authors [12]. Daligault, Gutin, Kim, and Yeo [6] improved the branching and obtained a running time of O(3.72k poly(n)). In this paper, we study the problem from an exponential time viewpoint, where it is equivalent to the Connected Dominating Set problem. Here, Fomin, Grandoni, and Kratsch showed how to break the Ω(2n

• Type: Conference
• Year: 2009
• Where: IWPEC
• Authors: Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
• Keywords: Applied Computing, IWPEC 2009, Maximum Leaf Spanning Tree, Simple Branching Algorithm, Undirected Graph