Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results

Anupam Gupta Kunal Talwar David Witmer

Published in: CoRR (2013)

Keyphrases

bounded treewidth
highly parallelizable
np complete
graph theory
computational complexity
learning algorithm
machine learning algorithms
information extraction
decision problems
lower bound
np hard
planar graphs