Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

WG
2009
Springer

favoriteEmaildiscussreport

99views Theoretical Computer Science» more WG 2009»

Exact and Parameterized Algorithms for Max Internal Spanning Tree

13 years 11 months ago

Exact and Parameterized Algorithms for Max Internal Spanning Tree

Download www.informatik.uni-trier.de

We consider the NP-hard problem of ﬁnding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamicprogramming algorithms for general and degree-bounded graphs have running times of the form O∗ (cn ) (c ≤ 3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only

Henning Fernau, Serge Gaspers, Daniel Raible

Real-time Traffic

Computer Science | Hamiltonian Path Problem | Maximum Number | NP-hard Problem | WG 2009 |

claim paper

Related Content

» Sharp Separation and Applications to Exact and Parameterized Algorithms

» A Linear Vertex Kernel for Maximum Internal Spanning Tree

» An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

» Limits and Applications of Group Algebras for Parameterized Problems

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

» The Complexity Ecology of Parameters An Illustration Using Bounded Max Leaf Number

» Schnyder decompositions for regular plane graphs and application to drawing

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	WG
Authors	Henning Fernau, Serge Gaspers, Daniel Raible

Comments (0)