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

Karolina Okrasa Pawel Rzazewski

Published in: CoRR (2019)

Keyphrases

bounded treewidth
fine grained
np complete
coarse grained
decision problems
tractable cases
conjunctive queries
boolean functions
fixed parameter tractable
relational learning
access control
computational complexity
databases
weighted graph
data lineage