minimum cut
Description: A partition of a graph's vertices into separate sets whose crossing edges have minimum total weight or capacity.
Primary topic: Complexity and Algorithms in Graphs (38%)
Wikidata ID: wiki/Q6865438
OpenAlex ID: keywords/minimum-cut
