Skip to Main content Skip to Navigation
Journal articles

A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-01179218
Contributor : Hélène Lowinger <>
Submitted on : Wednesday, July 22, 2015 - 9:15:16 AM
Last modification on : Wednesday, December 6, 2017 - 11:42:02 AM
Long-term archiving on: : Friday, October 23, 2015 - 10:24:53 AM

File

dmtcs-16-1-11.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01179218, version 1

Collections

Citation

Daniel Binkele-Raible, Henning Fernau. A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 1 (in progress) (1), pp.179--200. ⟨hal-01179218⟩

Share

Metrics

Record views

410

Files downloads

1563