90 search results - page 9 / 18 » Finding the Most Vital Node of a Shortest Path |
WWW
2009
ACM
14 years 8 months ago
2009
ACM
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
AINA
2008
IEEE
14 years 2 months ago
2008
IEEE
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
SIROCCO
2001
13 years 9 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...