Fast C-K-R Partitions of Sparse Graphs
classification
💻 cs.DS
keywords
fastgraphssparsepartitionsprobabilisticalgorithmalgorithmsapproximate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.