1.5k citations · 5.7k across the 60 of their papers we have counts for
1 paper · 1 filter
Aleksander Madry, Damian Straszak, Jakub Tarnawski
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected O~(m4/3) time. This imp…