minimum vertex cut


Definition: The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut.

See also minimum cut.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 19 April 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:
Paul E. Black, "minimum vertex 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:

to NIST home page