最終更新日:2022/12/07
正解を見る
(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.
編集履歴(0)
元となった辞書の項目
maximum cut
noun