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.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback