Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs

DOI10.1137/1.9781611975994.97OpenAlexW2949385111MaRDI 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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

This page was built for publication: Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs