Optimal Padded Decomposition For Bounded Treewidth Graphs.
Arnold FiltserTobias FriedrichDavis IssacNikhil KumarHung LeNadym MallekZiena ZeifPublished in: CoRR (2024)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- optimal solution
- conjunctive queries
- highly parallelizable
- graph theoretic
- relational learning
- decision makers
- dynamic programming
- boolean functions
- objective function
- sufficient conditions
- data management
- information extraction
- graph theory
- search space
- machine learning