Definition: The smallest set of edges in an undirected graph which separate two distinct vertices. That is, every path between them includes some member of the set.
See also minimum vertex cut, cut.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 19 April 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "minimum cut", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/minimumcut.html