ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wikipedia
出典:『Wikipedia』 (2011/04/20 02:38 UTC 版)
In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible. Several algorithms exist to find minimum cuts.
minimum cut