24 citations · 151 across the 43 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2011★ 7 cited
Cuts in Cartesian Products of Graphs
Sushant Sachdeva, Madhur Tulsiani
The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal i…
cs.DM2011
A Reformulation of the Arora-Rao-Vazirani Structure Theorem
Sanjeev Arora, James Lee, Sushant Sachdeva
In a well-known paper[ARV], Arora, Rao and Vazirani obtained an O(sqrt(log n)) approximation to the Balanced Separator problem and Uniform Sparsest Cut. At the heart of their resul…