83 citations · 303 across the 25 of their papers we have counts for
1 paper · 2 filters
Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy +1
We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, d≤1/λ2+o(1)) trade-off…