| Information | |
|---|---|
| has gloss | eng: For a graph, a maximum cut is a cut whose size is not smaller than the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem. |
| lexicalization | eng: maximum cut |
| instance of | c/Computational problems in graph theory |
| Meaning | |
|---|---|
| German | |
| lexicalization | deu: Maximaler Schnitt |
| Media | |
|---|---|
| media:img | Max-cut.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
