Sciweavers

Share
SODA
2003
ACM

The cover time of sparse random graphs

9 years 19 days ago
The cover time of sparse random graphs
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
Colin Cooper, Alan M. Frieze
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Colin Cooper, Alan M. Frieze
Comments (0)
books