214 search results - page 5 / 43 » Note on Sparse Random Graphs and Cover Graphs |
108
Voted
RSA
2008
15 years 18 days ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
122
Voted
RSA
2011
14 years 8 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
146
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
105
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
83
Voted
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
