Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202)
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 1965240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. |
scientific article; zbMATH DE number 1965240 |
Statements
Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (English)
0 references
17 August 2003
0 references
\(H\)-colourable subgraphs
0 references
0.8213738799095154
0 references
0.8055912852287292
0 references
0.7942109704017639
0 references
