13 citations · 18 across the 4 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DM2009
Electric routing and concurrent flow cutting
Jonathan Kelner, Petar Maymounkov
We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new r…
cs.DS2009★ 13 cited
Faster generation of random spanning trees
Jonathan A. Kelner, Aleksander Madry
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wit…