93 citations · 537 across the 73 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2013
Fully Dynamic -Approximate Matchings
Manoj Gupta, Richard Peng
We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is…