65 search results - page 2 / 13 » On the Cover Time of Random Geometric Graphs |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
RSA
2008
13 years 4 months 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 ...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
MSWIM
2006
ACM
13 years 11 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
WAW
2004
Springer
13 years 10 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...