Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth.
Marek CyganDániel MarxMarcin PilipczukMichal PilipczukPublished in: MFCS (2) (2014)
Keyphrases
- bounded treewidth
- np complete
- conjunctive queries
- decision problems
- boolean functions
- highly parallelizable
- relational learning
- graph mining
- np hard
- graph structures
- data exchange
- graph properties
- database
- constraint satisfaction problems
- incomplete information
- integrity constraints
- data management
- state space
- lower bound
- computational complexity
- fixed parameter tractable
- learning algorithm