Approximating Sparsest Cut in Graphs of Bounded Treewidth.

Eden Chlamtac Robert Krauthgamer Prasad Raghavendra

Published in: APPROX-RANDOM (2010)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
highly parallelizable
relational learning
boolean functions
fixed parameter tractable
np hard
query answering
graph theoretic
data complexity
decision making
knowledge base
query language
planar graphs