Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs.

Karolina Okrasa Pawel Rzazewski

Published in: SODA (2020)

Keyphrases

bounded treewidth
fine grained
np complete
decision problems
coarse grained
tractable cases
access control
conjunctive queries
fixed parameter tractable
boolean functions
relational learning
computational complexity
np hard
graph theoretic
bounded degree
query evaluation
labeled data
relational databases