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

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov

Journal title: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Published year: 2022

Published pages: 66:1--66:20

DOI identifier: 10.4230/lipics.icalp.2022.66