Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
From MaRDI portal
Publication:5146875
DOI10.1137/1.9781611975994.97MaRDI QIDQ5146875
Paweł Rzążewski, Karolina Okrasa
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975994.97
68Wxx: Algorithms in computer science
Related Items