69 search results - page 2 / 14 » The cover time of sparse random graphs |
127
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
138
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
111
click to vote
RSA
2008
15 years 1 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 ...
124
click to vote
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...
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
