Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875)
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: Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs |
scientific article; zbMATH DE number 7304120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs |
scientific article; zbMATH DE number 7304120 |
Statements
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (English)
0 references
2 February 2021
0 references
0.9996284
0 references
0.90858275
0 references
0.89589524
0 references
0.8943606
0 references
0.8934666
0 references
0 references
