Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

CORR
2008
Springer

favoriteEmaildiscussreport

147views Education» more CORR 2008»

C-K-R Partitions of Sparse Graphs

13 years 11 months ago

C-K-R Partitions of Sparse Graphs

Download cjtcs.cs.uchicago.edu

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

Real-time Traffic

Approximate Distance Oracles | CORR 2008 | Education | Probabilistic Embeddings | Sparse Graphs |

claim paper

Related Content

» A partitioning algorithm for blockdiagonal matrices with overlap

» Sparse Cut Projections in Graph Streams

» A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

» Multilevel Graph Partitioning Schemes

» Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions

» Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method

» Graph coloring in the estimation of sparse derivative matrices Instances and applications

» Local Graph Partitions for Approximation and Testing

» Multilevel kway Partitioning Scheme for Irregular Graphs

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Manor Mendel, Chaya Schwob

Comments (0)