Paper

On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs

Anupam Gupta, Kunal Talwar, and David Witmer. 2013. On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs. In Annual ACM Symposium on Theory of Computing. 281–290.

2013

Created by ACM worker at 2019-04-10 16:11:53.0.
Simplified Graph of Associations
Word Cloud
Quid