Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:48, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights |
scientific article |
Statements
Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (English)
0 references
30 May 2007
0 references
maximum constraint satisfaction problem
0 references
digraph \(H\)-colouring
0 references
complexity
0 references
dichotomy
0 references
