NP-hard problem | Sciweavers

112

WG
2009
Springer

99views Theoretical Computer Science» more WG 2009»

Exact and Parameterized Algorithms for Max Internal Spanning Tree

15 years 9 months ago

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...

Henning Fernau, Serge Gaspers, Daniel Raible

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers