A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present a polynomial time algorithm that for any graph G and integer k ≥ 0, either nds a spanning tree with at least k internal vertices, or outputs a new graph GR on at most 3k vertices and an integer k such that G has a spanning tree with at least k internal vertices if and only if GR has a spanning tree with at least k internal vertices. In other words, we show that the Maximum Internal Spanning Tree problem parameterized by the number of internal vertices k, has a 3k-vertex kernel. Ourdoi:10.1007/978-3-642-10631-6_29 fatcat:ijubxsk7hfabdftqugr5orgdsy