simple_max_cut (323B)
1 # Simple max cut 2 3 in [dahlhaus1994complexity]: given an [undirected_graph] and an [integer] K, find a partition of the [vertices] in two [sets] V1 and V2 such that there are at least K [edges] between V1 and V2 4 5 [NP_complete] [computational_problem] 6 7 See also: [multiway_cut], [cut] 8 9 Up: [computational_problem] on [graph]