The fine-grained complexity of graph homomorphism parameterized by clique-width (Q6560860)
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 7870276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The fine-grained complexity of graph homomorphism parameterized by clique-width |
scientific article; zbMATH DE number 7870276 |
Statements
The fine-grained complexity of graph homomorphism parameterized by clique-width (English)
0 references
24 June 2024
0 references
homomorphism
0 references
clique-width
0 references
fine-grained complexity
0 references
0.859590470790863
0 references
0.8181692361831665
0 references
0.8122023940086365
0 references
0.7927179932594299
0 references
