Inicio > 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.
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
- 100% positive feedback