43 search results - page 9 / 9 » Random graphs with forbidden vertex degrees |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...