Exact and Parameterized Algorithms for Max Internal Spanning Tree

We consider the -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 with c ≤2. For graphs...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 65; no. 1; pp. 95 - 128
Main Authors:	Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.01.2013 Springer Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Programming languages Software Theoretical computing Theory of Computation Measure and conquer Parameterized algorithms Spanning tree problems Maximum internal spanning trees Exact exponential-time algorithms Branching Compilation Hamiltonian path Algorithmics Routing Identifier Spanning tree NP hard problem Exponential time Graph degree Dynamic programming Time complexity Algorithm analysis
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!