Home > Term: minimum vertex cut
minimum vertex cut
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.
- Part of Speech: noun
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Creator
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
