14 citations · 33 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 7 cited
Improved Parallel Algorithms for Spanners and Hopsets
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…
cs.DS2013★ 14 cited
Parallel Graph Decompositions Using Random Shifts
Gary L. Miller, Richard Peng, Shen Chen Xu
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions…