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