410 search results - page 6 / 82 » Upgrading Shortest Paths in Networks |
ICN
2005
Springer
15 years 5 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiď¬...
126
click to vote
OL
2011
14 years 6 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
106
click to vote
ICDCS
2012
IEEE
13 years 2 months ago
2012
IEEE
—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...
CMOT
2000
14 years 11 months ago
2000
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
107
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...