BRZEN
Minimum cut
Texto da Wikipédia (en), licença CC BY-SA. O BETARUBI mostra o verbete inteiro nesta página — a leitura não continua fora do site.
In graph theory, a minimum cut or min-cut of a graph is a cut that is minimal in some metric. In the simplest unweighted min-cut problem, the goal is to minimize the number of edges connecting the two parts.