Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/1.9781611975994.97 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2949385111 / rank | |||
Normal rank |
Latest revision as of 19:44, 19 March 2024
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