Complexity of correspondence \(H\)-colourings (Q2184689)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7206543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of correspondence \(H\)-colourings |
scientific article; zbMATH DE number 7206543 |
Statements
Complexity of correspondence \(H\)-colourings (English)
0 references
29 May 2020
0 references
graph homomorphisms
0 references
\(H\)-colourings
0 references
correspondence colourings
0 references
DP-colourings
0 references
dichotomy
0 references
NP-completeness
0 references
polynomial algorithms
0 references
0 references
0.9254637956619264
0 references
0.8255133032798767
0 references
0.8253570199012756
0 references
0.8236925005912781
0 references
0.8079190254211426
0 references
