65 search results - page 2 / 13 » The cover time of random geometric graphs |
SODA
2003
ACM
15 years 1 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
14 years 11 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
15 years 5 months ago
2007
Springer
125
Voted
MSWIM
2006
ACM
15 years 5 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...
85
Voted
WAW
2004
Springer
15 years 5 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, ...