Sciweavers

126 search results - page 26 / 26
» INFOCOM 2012
Sort
View
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 1 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled