Maximum cutMaximum cut
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- 1 player has it in their collection.
What Wikipedia says
In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible. Finding such a cut is known as the max-cut problem.
Excerpt from the Wikipedia article “Maximum cut”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Miym, CC BY-SA 3.0, via Wikimedia Commons.
Open free boosters and add Maximum cut to your collection.
Play for free




