1. Binkele-Raible D, Fernau H, Gaspers S, Liedloff M (2013) Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1):95–128
2. Chen ZZ, Lin G, Wang L, Chen Y (2016) Approximation algorithms for the maximum weight internal spanning tree problem. CoRR.
arxiv:abs/1608.03299
3. Coben N, Fomin FV, Gutin G, Kim EJ, Saurabh S, Yeo A (2010) Algorithm for finding k-vertex out-trees and its application to
$$k$$
k
-internal out-branching problem. JCSS 76:650–662
4. Fomin FV, Lokshtanov D, Grandoni F, Saurabh S (2012) Sharp separation and applications to exact and parameterized algorithms. Algorithmica 63:692–706
5. Fomin FV, Gaspers S, Saurabh S, Thomasse S (2013) A linear vertex kernel for maximum internal spanning tree. JCSS 79:1–6