ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wikipedia
出典:『Wikipedia』 (2011/05/26 23:58 UTC 版)
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.
Maximum cut