The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width (bibtex)
by , , , ,
Reference:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthRobert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, 2022.Note: to appear
Bibtex Entry:
@inproceedings{GanianHKOS22,
  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},
  booktitle = {49th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2022, July 4-8, 2022, Paris, France},
  year      = {2022},
  keywords = {nfpc,ParAI},
  note = {to appear}  
}
Powered by bibtexbrowser