Sciweavers

Share
CORR
2008
Springer

C-K-R Partitions of Sparse Graphs

11 years 1 months ago
C-K-R Partitions of Sparse Graphs
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 probabilistic partitions of Calinescu, Karloff, and Rabani in sparse graphs.
Manor Mendel, Chaya Schwob
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Manor Mendel, Chaya Schwob
Comments (0)
books