A $2k$-Vertex Kernel for Maximum Internal Spanning Tree

Wenjun Li, Jianxin Wang, Jianer Chen +1

We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k…