7 citations · 7 across the 1 of their papers we have counts for
1 paper
Gary L. Miller, Richard Peng, Adrian Vladu +1
We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposi…