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

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
January 2022
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. 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff), volume 229 of LIPIcs, pages 66:1-66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Type
Conference Paper
ParAI Nfpc
Robert Ganian
Robert Ganian

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