467 search results - page 71 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
PODS
1991
ACM
13 years 11 months ago
1991
ACM
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
OPODIS
2008
13 years 8 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
MATES
2010
Springer
13 years 5 months ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...