Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs.
Karolina OkrasaMarta PiecykPawel RzazewskiPublished in: ESA (2020)
Keyphrases
- bounded treewidth
- np complete
- tractable cases
- decision problems
- conjunctive queries
- highly parallelizable
- supervised learning
- relational learning
- graph theoretic
- fixed parameter tractable
- machine learning
- support vector
- decision trees
- support vector machine
- special case
- active learning
- computational complexity
- graph theory