37 search results - page 6 / 8 » Alternative Route Graphs in Road Networks |
105
click to vote
HICSS
2008
IEEE
14 years 9 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
EOR
2006
14 years 9 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
TSP
2008
14 years 9 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
DAM
2007
14 years 9 months ago
2007
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...