Home >  Term: minimum cut
minimum cut

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.

0 0

Creator

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