Content deleted Content added
→Approximation algorithms: It's not guaranteed, unless P = NP, as shown in the previous sentence Tags: Mobile edit Mobile web edit |
Changed image -> file for clarity |
||
Line 1:
[[
For a [[Graph (discrete mathematics)|graph]], a '''maximum cut''' is a [[cut (graph theory)|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.'''
| |||