2 citations · 3 across the 8 of their papers we have counts for
1 paper · 1 filter
Ruoxu Cen, Yu Cheng, Debmalya Panigrahi +1
In this paper, we consider the problem of designing cut sparsifiers and sketches for directed graphs. To bypass known lower bounds, we allow the sparsifier/sketch to depend on the…