MaxCut on permutation graphs is NP‐complete (Q6047965)
From MaRDI portal
scientific article; zbMATH DE number 7747704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MaxCut on permutation graphs is NP‐complete |
scientific article; zbMATH DE number 7747704 |
Statements
MaxCut on permutation graphs is NP‐complete (English)
0 references
10 October 2023
0 references
computational complexity
0 references
maximum cut
0 references
NP-complete
0 references
permutation graphs
0 references
