An Efficient Partitioning Oracle for Bounded-Treewidth Graphs

Alan Edelman Avinatan Hassidim Huy N. Nguyen Krzysztof Onak

Published in: CoRR (2011)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
boolean functions
relational learning
highly parallelizable
graph partitioning
fixed parameter tractable
bayesian networks
semi supervised learning
constraint satisfaction problems
data exchange
bounded degree