390 search results - page 11 / 78 » Computing shortest paths for any number of hops |
142
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
109
click to vote
CPC
2006
14 years 11 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
109
click to vote
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
115
click to vote
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
DSN
2003
IEEE
15 years 5 months ago
2003
IEEE
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...