The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad Kanj +1

Given a tree $T$ on $n$ vertices, and $k,b,s_1,\dots ,s_b\in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting componen…