maximum cut
a cut of a graph whose size is at least the size of any other cut
Press Enter · cited answer in seconds
0 sources
maximum cut
Summary
maximum cut is a computational problem[1]. It draws 125 Wikipedia views per month (computational_problem category, ranking #21 of 61).[2]
Key Facts
- maximum cut's image is recorded as Max-cut.svg[3].
- maximum cut's instance of is recorded as computational problem[4].
- maximum cut's subclass of is recorded as cut[5].
- maximum cut's part of is recorded as Karp's 21 NP-complete problems[6].
- maximum cut's opposite of is recorded as minimum cut[7].
- maximum cut's Freebase ID is recorded as /m/04n598f[8].
- maximum cut's Microsoft Academic ID is recorded as 165526019[9].
- maximum cut's OpenAlex ID is recorded as C165526019[10].
- maximum cut's computational complexity is recorded as NP-complete[11].
- maximum cut's graphclasses.org ID is recorded as problem_Maximum_cut[12].
Why It Matters
maximum cut draws 125 Wikipedia views per month (computational_problem category, ranking #21 of 61).[2] It has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.[13] It is known by 4 alternative names across languages and contexts.[14]