Source: wikibot/minimum-k-cut
= Minimum k-cut
{wiki=Minimum_k-cut}
The minimum \\( k \\)-cut problem is a classic problem in graph theory and combinatorial optimization. It involves partitioning the vertices of a given graph into \\( k \\) disjoint subsets (or "parts") in such a way that the total weight of the edges that need to be cut (i.e., the edges that connect vertices in different subsets) is minimized.