62 search results - page 11 / 13 » Closed k-stop distance in graphs |
SMA
2008
ACM
13 years 6 months ago
2008
ACM
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
TROB
2008
13 years 6 months ago
2008
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
PODC
2004
ACM
14 years 11 days ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...