The complexity of SIMPLE MAX-CUT on comparability graphs (Q510977)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of SIMPLE MAX-CUT on comparability graphs |
scientific article; zbMATH DE number 6684464
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of SIMPLE MAX-CUT on comparability graphs |
scientific article; zbMATH DE number 6684464 |
Statements
The complexity of SIMPLE MAX-CUT on comparability graphs (English)
0 references
14 February 2017
0 references
max-cut
0 references
comparability graphs
0 references
computational complexity
0 references
