maximum cut

英語（米国） (en-US) 英語（イギリス） (en-GB)

名詞

(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible.

日本語の意味

グラフ理論において、グラフの頂点集合を相補集合となる2つの部分集合に分割し、その2集合間を結ぶ辺の数が、他のどのような分割の場合よりも大きくなるようなカット。 / グラフの頂点を2つの補集合に分け、その分割で辺の数が最大になる場合のカット。

英語の意味

(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible.

このボタンはなに？

To approximate the maximum cut, the research team applied a randomized rounding technique that consistently produced near-optimal partitions.

最大カットを近似するために、研究チームは一貫してほぼ最適な分割を生成するランダム化ラウンディング手法を適用した。

詳細

意味（1）

(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible.

maximum cuts （ plural ）