maximum cut

a cut of a graph whose size is at least the size of any other cut
Class type of: cut Q942557

Facts

5 properties
Subclass of
cut[2]
Computational complexity
NP-complete[5]
Opposite of
minimum cut[4]
🏷️ Also known as
en maximum cut en Max-Cut problem cs maximální řez de maximaler Schnitt fa برش بیشینه fr coupe maximum hu maximális vágás it problema max-cut it max-cut it problema del taglio massimo it taglio massimo ja 最大カット問題 nl maximale snede pt corte máximo ro tăietura maximă ru Максимальный разрез графа uk Максимальний переріз графу zh 最大割問題
🔖 Identifiers · 5
OpenAlex ID
C165526019
Image (Wikimedia Commons)
Max-cut.svg ↗
Freebase ID
/m/04n598f
Graphclasses.org ID
problem_Maximum_cut
Microsoft Academic ID (discontinued)
165526019

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Belongs to 1
Computational complexity 1
Instance of 1
Opposite of 1
Part of 1
Subclass of 1
cut
← Opposite of 1
Press Enter · cited answer in seconds

Summary

maximum cut is a computational problem[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). maximum cut. Retrieved November 17, 2026, from https://4ort.xyz/entity/maximum-cut
MLA “maximum cut.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Nov. 2026, https://4ort.xyz/entity/maximum-cut.
BibTeX @misc{4ortxyz_maximum-cut_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{maximum cut}}, year = {2026}, url = {https://4ort.xyz/entity/maximum-cut}, note = {Accessed: 2026-11-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): maximum cut — https://4ort.xyz/entity/maximum-cut (retrieved 2026-11-17)

Canonical URL: https://4ort.xyz/entity/maximum-cut · Last refreshed: