 |
Discrete Mathematics & Theoretical Computer Science |
Daniel Binkele-Raible ; Henning Fernau - A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
dmtcs:1256 - Discrete Mathematics & Theoretical Computer Science, March 30, 2014, Vol. 16 no. 1 - https://doi.org/10.46298/dmtcs.1256A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected GraphArticle
- 1 Trier University
- 2 Trier Universität = Trier University = Université de Trèves [Uni Trier]
- 3 Trier Universität = Trier University = Université de Trèves [Allemagne] [Uni Trier]
Discrete Algorithms
[en]
The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is known to be NP-hard. We present an algorithm which finds a spanning tree with at least k leaves in time O*(3.4575k) which improves the currently best algorithm. The estimation of the running time is done by using a non-standard measure. The present paper is one of the still few examples that employ the Measure & Conquer paradigm of algorithm analysis in the area of Parameterized Algorithmics.
Source: HAL:hal-01179218v1
Volume: Vol. 16 no. 1
Section: Discrete Algorithms
Published on: March 30, 2014
Imported on: May 8, 2012
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Parameterized algorithms, graph algorithms, spanning trees
1 Document citing this article
Consultation statistics
This page has been seen 660 times.
This article's PDF has been downloaded 1279 times.