Fast C-K-R Partitions of Sparse Graphs
Data Structures and Algorithms
2009-09-09 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0809.1902,
title = {Fast C-K-R Partitions of Sparse Graphs},
author = {Manor Mendel and Chaya Schwob},
journal= {arXiv preprint arXiv:0809.1902},
year = {2009}
}
Comments
15 pages, title changed, a small error in the running time was fixed. Many errors in English were eliminated