Sparsest cut on bounded treewidth graphs: algorithms and hardness results.

Anupam Gupta Kunal Talwar David Witmer

Published in: STOC (2013)

Keyphrases

bounded treewidth
computational complexity
np complete
highly parallelizable
graph theory
databases
learning algorithm
knowledge base
reinforcement learning
domain knowledge