Robuta

https://ligm.univ-eiffel.fr/seminaire/good-and-efficient-approximation-for-the-sparsest-cut-problem-in-bounded-treewidth-graphs/ Good and Efficient Approximation for the Sparsest Cut Problem in Bounded-Treewidth Graphs –... sparsest cut problem good and for the efficient approximation