632 search results - page 14 / 127 » On Routing in Circulant Graphs |
ICCCN
2008
IEEE
14 years 4 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
ISI
2007
Springer
14 years 3 months ago
2007
Springer
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
PERCOM
2006
ACM
14 years 9 months ago
2006
ACM
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
SIAMDM
2010
13 years 4 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
COR
2006
13 years 9 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...