Hitting forbidden induced subgraphs on bounded treewidth graphs.
Ignasi SauUéverton S. SouzaPublished in: CoRR (2020)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- conjunctive queries
- graph mining
- boolean functions
- highly parallelizable
- graph databases
- relational learning
- np hard
- graph theoretic
- graph data
- computational complexity
- graph properties
- fixed parameter tractable
- query answering
- semi supervised
- reachability queries
- machine learning