MaxCut
Description: The maximum cut problem in graph theory seeks a partition of a graph’s vertices that maximizes the number or total weight of edges crossing the partition.
Primary topic: Complexity and Algorithms in Graphs (31%)
Wikidata ID: wiki/Q942557
OpenAlex ID: keywords/max-cut
