Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Given a graph G = (V ,E) with n vertices and m edges, and a subset T of k vertices called terminals, the Edge (respectively, Vertex) Multiterminal Cut problem is to find a set of at most l edges (non-terminal vertices), whose removal from G separates each terminal from all the others. These two prob