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.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Manor Mendel, Chaya Schwob
• Keywords: Approximate Distance Oracles, CORR 2008, Education, Probabilistic Embeddings, Sparse Graphs