maximum cut
a cut of a graph whose size is at least the size of any other cut
Facts
5 properties- Instance of
- computational problem
- 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
🔗 Connections
Belongs to 1
Computational complexity 1
Instance of 1
Opposite of 1
Part of 1
Subclass of 1
← Opposite of 1
Press Enter · cited answer in seconds
0 sources
Summary
maximum cut is a computational problem[1].