1078 search results - page 3 / 216 » Networks with Small Stretch Number |
ICNP
2005
IEEE
14 years 28 days ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
SPAA
2003
ACM
14 years 18 days ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...