Approximability Distance in the Space of H-Colourability Problems (Q3392945)
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: Approximability Distance in the Space of H-Colourability Problems |
scientific article; zbMATH DE number 5596326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability Distance in the Space of H-Colourability Problems |
scientific article; zbMATH DE number 5596326 |
Statements
Approximability Distance in the Space of H-Colourability Problems (English)
0 references
18 August 2009
0 references
optimisation
0 references
approximability
0 references
graph homomorphism
0 references
graph \(H\)-colouring
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0.8118338584899902
0 references
0.8116440773010254
0 references
0.8045517802238464
0 references
0.7688989043235779
0 references
0.7665498852729797
0 references
