Assertion: k cut | /r/CapableOf | require finding a set of edges
Facets:
Source sentences:
text: In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to at least k connected components.