by Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
Reference:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthRobert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill SimonovACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.
Bibtex Entry:
@article{GanianHKOS24,
author = {Robert Ganian and
Thekla Hamm and
Viktoriia Korchemna and
Karolina Okrasa and
Kirill Simonov},
title = {The Fine-Grained Complexity of Graph Homomorphism Parameterized by
Clique-Width},
journal = {{ACM} Trans. Algorithms},
volume = {20},
number = {3},
pages = {19},
year = {2024},
url = {10.1145/3652514">https://doi.org/10.1145/3652514},
doi = {10.1145/3652514},
keywords = {nfpc,ParAI}
}