(definition)
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.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Mon Sep 11 09:46:05 2006.
Cite this as:
Paul E. Black, "minimum cut", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/minimumcut.html
