Sparsest cut on bounded treewidth graphs: Algorithms and hardness results

Anupam Gupta, Kunal Talwar, David Witmer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fingerprint

Dive into the research topics of 'Sparsest cut on bounded treewidth graphs: Algorithms and hardness results'. Together they form a unique fingerprint.

Engineering & Materials Science