390 search results - page 6 / 78 » Computing shortest paths for any number of hops |
110
click to vote
SSD
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
77
Voted
SIROCCO
2003
15 years 1 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
116
Voted
SIGMETRICS
2005
ACM
15 years 5 months ago
2005
ACM
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
PODC
2006
ACM
15 years 5 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...
160
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...