Definition: A nonempty, proper subset of vertices of a graph.
Note: After [Leda98].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue May 6 13:48:55 2014.
Cite this as:
Paul E. Black, "cut", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/cut.html