90 search results - page 11 / 18 » Finding the Most Vital Node of a Shortest Path |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
NETWORKS
2006
13 years 7 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
MOBICOM
2003
ACM
14 years 23 days ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
AAAI
2010
13 years 9 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
ALENEX
2010
13 years 9 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...