Login / Signup
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
Robert Ganian
Thekla Hamm
Viktoriia Korchemna
Karolina Okrasa
Kirill Simonov
Published in:
ACM Trans. Algorithms (2024)
Keyphrases
</>
fine grained
coarse grained
access control
graph properties
maximum clique
structured data
independent set
tightly coupled
spanning tree
maximum weight
data lineage
graph theory
massively parallel
quasi cliques
worst case
weighted graph
directed graph