Login / Signup
Approximating Sparsest Cut in Graphs of Bounded Treewidth
Eden Chlamtac
Robert Krauthgamer
Prasad Raghavendra
Published in:
CoRR (2010)
Keyphrases
</>
bounded treewidth
np complete
decision problems
conjunctive queries
highly parallelizable
boolean functions
relational learning
fixed parameter tractable
bounded degree
data mining
computational complexity
relational databases
utility function