Hitting forbidden induced subgraphs on bounded treewidth graphs.
Ignasi SauUéverton dos Santos SouzaPublished in: Inf. Comput. (2021)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- conjunctive queries
- highly parallelizable
- graph properties
- boolean functions
- graph mining
- graph databases
- fixed parameter tractable
- relational learning
- graph theoretic
- reachability queries
- relational databases
- computational complexity
- bounded degree
- data exchange
- databases
- graph data
- subgraph isomorphism
- special case
- labeled graphs
- information retrieval