Accueil > 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.
- Partie du discours : noun
- Secteur d’activité/Domaine : Informatique
- Catégorie : Algorithms & data structures
- Government Agency: NIST
0
Créateur
- GeorgeV
- 100% positive feedback