12 search results - page 3 / 3 » The Diameter of Randomly Perturbed Digraphs and Some Applica... |
CN
2008
13 years 6 months ago
2008
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
MST
2010
13 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...