29 citations · 45 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Explicit Expanding Expanders
Michael Dinitz, Michael Schapira, Asaf Valadarsky
Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite famili…
cs.DS2015★ 1 cited
Towards Resistance Sparsifiers
Michael Dinitz, Robert Krauthgamer, Tal Wagner
We study resistance sparsification of graphs, in which the goal is to find a sparse subgraph (with reweighted edges) that approximately preserves the effective resistances between…