69 search results - page 1 / 14 » The cover time of sparse random graphs |
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
CPC
2006
13 years 4 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
COMBINATORICS
2000
13 years 4 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
JCT
2007
13 years 4 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...