most citedFast C-K-R Partitions of Sparse Graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2008★ 1 cited

Fast C-K-R Partitions of Sparse Graphs

Manor Mendel, Chaya Schwob

We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pro…