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

Robert Ganian Thekla Hamm Viktoriia Korchemna Karolina Okrasa Kirill Simonov

Published in: CoRR (2022)

Keyphrases

fine grained
coarse grained
maximum weight
access control
graph properties
quasi cliques
tightly coupled
structured data
graph theory
directed graph
bipartite graph
massively parallel
graph theoretic
maximum clique
maximal clique enumeration
high level
maximal cliques
graph mining
weighted graph
worst case