Full complexity classification of the list homomorphism problem for bounded-treewidth graphs.
Karolina OkrasaMarta PiecykPawel RzazewskiPublished in: CoRR (2020)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- tractable cases
- conjunctive queries
- highly parallelizable
- machine learning
- feature selection
- fixed parameter tractable
- boolean functions
- support vector machine
- supervised learning
- training set
- computational complexity
- text classification
- feature space
- support vector
- reinforcement learning
- decision trees
- data mining
- prior knowledge
- database
- model selection
- graph theory
- graph theoretic
- knowledge base