An Efficient Partitioning Oracle for Bounded-Treewidth Graphs.

Alan Edelman Avinatan Hassidim Huy N. Nguyen Krzysztof Onak

Published in: APPROX-RANDOM (2011)

Keyphrases

bounded treewidth
np complete
conjunctive queries
decision problems
highly parallelizable
boolean functions
tractable cases
relational learning
computational complexity
integrity constraints
oracle database
graph partitioning
bounded degree
database
graph theoretic