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.

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.