203 citations · 288 across the 21 of their papers we have counts for
1 paper · 1 filter
Anand Louis
We give O(log^2 n)-approximation algorithm based on the cut-matching framework of [10, 13, 14] for computing the sparsest cut on directed graphs. Our algorithm uses only O(log^2 n)…