3 search results - page 1 / 1 » Random Regular Graphs Of Non-Constant Degree: Independence A... |
CPC
2002
13 years 5 months ago
2002
COMBINATORICS
2004
13 years 5 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...