3 search results - page 1 / 1 » Random Regular Graphs Of Non-Constant Degree: Independence A... |
75
Voted
CPC
2002
15 years 18 days ago
2002
107
Voted
COMBINATORICS
2004
15 years 19 days 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...
111
click to vote
APPROX
2010
Springer
15 years 2 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...