Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs.
Karolina OkrasaPawel RzazewskiPublished in: SIAM J. Comput. (2021)
Keyphrases
- bounded treewidth
- fine grained
- np complete
- coarse grained
- decision problems
- tractable cases
- conjunctive queries
- relational learning
- access control
- fixed parameter tractable
- boolean functions
- bounded degree
- information extraction
- data lineage
- computational complexity
- database
- graph theoretic
- databases
- undirected graph
- inductive logic programming
- constraint satisfaction problems
- machine learning
- weighted graph
- graph structure
- graph theory
- query evaluation
- monadic datalog