max-cut problem
Description: A combinatorial optimization problem that partitions a graph’s vertices to maximize the total weight of edges crossing between the two groups.
Primary topic: Complexity and Algorithms in Graphs (25%)
Wikidata ID: wiki/Q942557
OpenAlex ID: keywords/maximum-cut-problem
