Exact and Parameterized Algorithms for Max Internal Spanning Tree - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Exact and Parameterized Algorithms for Max Internal Spanning Tree

Henning Fernau
  • Function : Author
  • PersonId : 857693
Serge Gaspers
  • Function : Author
  • PersonId : 936216
Daniel Raible
  • Function : Author
  • PersonId : 857696

Abstract

We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form O(c^n) (c ≤ 3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only needs polynomial space and has a running time of O(1.8669^n) when analyzed with respect to the number of vertices. We also show that its running time is 2.1364^k n^(O(1)) when the goal is to find a spanning tree with at least k internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analysis for parameterized algorithms.
No file

Dates and versions

lirmm-00432673 , version 1 (16-11-2009)

Identifiers

  • HAL Id : lirmm-00432673 , version 1

Cite

Henning Fernau, Serge Gaspers, Daniel Raible. Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG'09: International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2009, Montpellier, France. pp.12. ⟨lirmm-00432673⟩
273 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More