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

Daniel Binkele-Raible 1 Henning Fernau 1
1 Universität Trier
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.
Keywords : Parameterized algorithms graph algorithms spanning trees
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 1 (in progress) (1), pp.179--200
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01179218
Contributeur : Hélène Lowinger <>
Soumis le : mercredi 22 juillet 2015 - 09:15:16
Dernière modification le : mercredi 6 décembre 2017 - 11:42:02
Document(s) archivé(s) le : vendredi 23 octobre 2015 - 10:24:53

Fichier

dmtcs-16-1-11.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01179218, version 1

Collections

TDS-MACS

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〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

138

Téléchargements de fichiers

442

Contact


archive-ouverte@inria.fr