Downey, Rodney G.; Estivill-Castro, V. (Vladimir); Fellows, Michael; Prieto, Elena; Rosamund, Frances A.
(Elsevier, 2003)
The Graph k-Cut problem is that of finding a set of edges of minimum total weight, in an edge-weighted graph, such that their removal from the graph results in a graph having at least k connected components. An algorithm ...