Keywords

#maximum_cut

Maximum cut

Problem of finding a maximum cut in a graph

In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is 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. Finding such a cut is known as the max-cut problem.

Mon 12th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Maximum cut Cut (graph theory) Max-flow min-cut theorem Minimum cut Maximum flow problem The Cut Segmentation-based object categorization Ising model Maximum Overdrive Constraint satisfaction problem
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.