High Quality Content by WIKIPEDIA articles! For a graph, a maximum cut is a cut whose size is not smaller than the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.The problem can be stated simply as follows. One wants a subset S of the vertex set such that the number of edges between S and the complementary subset is as large as possible.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.