Sciweavers

Share
INFOCOM
2011
IEEE

Approximate distance queries and compact routing in sparse graphs

10 years 3 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data structure that retrieves stretch 2k − 1 paths must require space Ω(n1+1/k ) for graphs of n nodes. The hard cases that enforce this lower bound are, however, rather dense graphs with average degree Ω(n1/k ). We present data structures that, for sparse graphs, substantially break that lower bound barrier at the expense of higher query time. For instance, general graphs require O(n3/2 ) space and constant query time for stretch 3 paths. For the realistic scenario of a graph with average degree Θ(log n), special cases of our data structures retrieve stretch 2 paths with ˜O(n3/2 ) space and stretch 3 paths with ˜O(n) space, albeit at the cost of ˜O( n) query time. Moreover, supported by large-scale simulations on graphs including the AS-level Internet graph, we argue that our stretch-2 scheme would be ...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha
Added 30 Aug 2011
Updated 30 Aug 2011
Type Journal
Year 2011
Where INFOCOM
Authors Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled
Comments (0)
books