A simpler and parallelizable O(alog n)-approximation algorithm for sparsest cut
V. Kolmogorov, in:, Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2024, pp. 403–414.