Abstract
The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is known to be -hard. We present an algorithm which finds a spanning tree with at least k leaves in time O *(3.4575 k ) 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 few examples that employ the Measure & Conquer paradigm of algorithm analysis, developed within the field of Exact Exponential-Time Algorithmics, within the area of Parameterized Algorithmics. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Raible, D., & Fernau, H. (2010). An amortized search tree analysis for k-leaf spanning tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5901 LNCS, pp. 672–684). https://doi.org/10.1007/978-3-642-11266-9_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
