268 search results - page 25 / 54 » Finding the k Shortest Paths |
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
TON
2002
13 years 7 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
JNW
2008
13 years 7 months ago
2008
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...