Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
verfasst von : Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
Erschienen in: Parameterized and Exact Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Given an undirected graph
G
with
n
nodes, the Maximum Leaf Spanning Tree problem asks to find a spanning tree of
G
with as many leaves as possible. When parameterized in the number of leaves
k
, this problem can be solved in time
O
(4
k
poly(
n
)) using a simple branching algorithm introduced by a subset of the authors [13]. Daligault, Gutin, Kim, and Yeo [6] improved this branching algorithm and obtained a running time of
O
(3.72
k
poly(
n
)). In this paper, we study the problem from an exact exponential time point of view, where it is equivalent to the Connected Dominating Set problem. For this problem Fomin, Grandoni, and Kratsch showed how to break the Ω(2
n
) barrier and proposed an
O
(1.9407
n
) time algorithm [10]. Based on some properties of [6] and [13], we establish a branching algorithm whose running time of
O
(1.8966
n
) has been analyzed using the Measure-and-Conquer technique. Finally we provide a lower bound of Ω(1.4422
n
) for the worst case running time of our algorithm.