A mincut of a finite edge-weighted undirected graph 
with at least two vertices
and nonnegative weights
is a cut of minimum weight.
The graph need not be simple.
A cut is specified by a nontrivial subset 
of 
, and its weight is the sum
of the weights of edges
crossing the cut. The problem is polynomial
time solvable as a series of network flow problems
or using the algorithm of Stoer and Wagner (1994).
Mincut
See also
Cut, Maxcut, Minimum Vertex Cut, Network Flow, Sparsest Cut, Weighted GraphExplore with Wolfram|Alpha
References
Stoer, M. and Wagner, F. "A Simple Min Cut Algorithm." In Algorithms--ESA '94: Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994. Proceedings (Ed. J. van Leeuwen). Berlin, Germany: Springer, pp. 141-147, 1994. https://doi.org/10.1007/BFb0049404.Referenced on Wolfram|Alpha
MincutCite this as:
Weisstein, Eric W. "Mincut." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Mincut.html