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 Transactions on Algorithms, 2024.Note: to appear
Bibtex Entry:
@string{talg="ACM Transactions on Algorithms"}
@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 = TALG,
year = {2024},
keywords = {nfpc,ParAI},
note = {to appear}
}