1100 search results - page 1 / 220 » Approximate distance oracles |
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
TKDE
2010
13 years 3 months ago
2010
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
FOCS
2009
IEEE
14 years 4 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...