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

Robert Ganian Thekla Hamm Viktoriia Korchemna Karolina Okrasa Kirill Simonov

Published in: ICALP (2022)

Keyphrases

fine grained
coarse grained
maximum weight
graph theory
access control
tightly coupled
independent set
graph properties
bipartite graph
graph theoretic
user intent
structured data
database
graph databases
parallel algorithm
minimum weight
data provenance
maximum clique
graphical models
bayesian networks