43 search results - page 7 / 9 » Querying approximate shortest paths in anisotropic regions |
106
Voted
KDD
2004
ACM
15 years 2 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
84
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
98
Voted
TKDE
2010
14 years 7 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...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...