Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs (Q5858645)
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 7333144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs |
scientific article; zbMATH DE number 7333144 |
Statements
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (English)
0 references
14 April 2021
0 references
fine-grained complexity
0 references
graph homomorphism
0 references
treewidth
0 references
projective graphs
0 references
0 references
0 references
0.8259768486022949
0 references
0.823307991027832
0 references
0.8200572729110718
0 references
0.8103464245796204
0 references
