Hitting forbidden subgraphs in graphs of bounded treewidth.
Marek CyganDániel MarxMarcin PilipczukMichal PilipczukPublished in: CoRR (2014)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- highly parallelizable
- conjunctive queries
- graph mining
- subgraph isomorphism
- boolean functions
- graph databases
- relational learning
- sufficient conditions
- databases
- graph theoretic
- graph structures
- connected subgraphs
- integrity constraints
- decision makers
- query processing
- reinforcement learning
- graph properties
- fixed parameter tractable
- reachability queries
- decision making