Defensive Alliances in Graphs of Bounded Treewidth.
Bernhard BliemStefan WoltranPublished in: CoRR (2017)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- relational learning
- conjunctive queries
- highly parallelizable
- tractable cases
- boolean functions
- constraint satisfaction problems
- fixed parameter tractable
- monadic datalog
- databases
- inductive logic programming
- relational data
- incomplete information
- information extraction
- relational databases
- computational complexity