Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz

Research output: Contribution to journalArticleScientificpeer-review

Fingerprint

Dive into the research topics of 'Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter'. Together they form a unique fingerprint.

Mathematics

Computer Science