Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz 0001. Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms, 20(1), January 2024. [doi]
Abstract is missing.