A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

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

Daniel Binkele-Raible
  • Function : Author
  • PersonId : 882604
Henning Fernau
  • Function : Author
  • PersonId : 857693

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.
Fichier principal
Vignette du fichier
dmtcs-16-1-11.pdf (4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01179218 , version 1 (22-07-2015)

Identifiers

Cite

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, 2014, Vol. 16 no. 1 (1), pp.179--200. ⟨10.46298/dmtcs.1256⟩. ⟨hal-01179218⟩

Collections

TDS-MACS
175 View
1138 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More