A cut of a flow network of minimum cut capacity among cuts separating the prescribed source and sink. The max-flow min-cut theorem identifies this capacity with the maximum possible flow value.
Articles by others on the same topic
In the context of graph theory, a **minimum cut** refers to a specific type of partitioning of a graph that separates the vertices into two distinct subsets while minimizing the total weight of the edges that cross between these two subsets. ### Key Concepts: - **Graph**: A collection of vertices (nodes) connected by edges (links). - **Cut**: A cut in a graph is a way of dividing the graph's vertices into two disjoint subsets.