Sciweavers

APPROX
2007
Springer
141views Algorithms» more  APPROX 2007»
13 years 11 months ago
The Cover Time of Random Digraphs
We study the cover time of a random walk on the random digraph Dn,p when np =
Colin Cooper, Alan M. Frieze