The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
January 2024
PDF bib Project Project DOI

Abstract

Full Citation:

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov. The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.

Type
Journal Article
ParAI Nfpc
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.