Minimum k-Cut

The minimum k-cut is a combinatorial optimization problem that asks for a set of edges, called a k-cut, whose removal partitions a graph into at least k connected components, with the objective of finding the minimum weight such set. It has practical applications in VLSI design, data mining, finite element analysis, and parallel computing communications. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/