Fast C-K-R Partitions of Sparse Graphs

Details Fast C-K-R Partitions of Sparse Graphs Fast C-K-R Partitions of Sparse Graphs

2008-09-11

arxiv.org/abs/0809.1902v2

Chicago J. Theoretical Comp. Sci., 2009(2), 2009

Computer Science

Data Structures and Algorithms

15 pages, title changed, a small error in the running time was fixed. Many errors in English were eliminated

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast C-K-R Partitions of Sparse Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast C-K-R Partitions of Sparse Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast C-K-R Partitions of Sparse Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473351