Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

Voted

APPROX
2007
Springer

141views Algorithms» more APPROX 2007»

The Cover Time of Random Digraphs

15 years 10 months ago

The Cover Time of Random Digraphs

Download www.dcs.kcl.ac.uk

We study the cover time of a random walk on the random digraph Dn,p when np =

Colin Cooper, Alan M. Frieze

Real-time Traffic

Algorithms | APPROX 2007 | P | Random Digraph Dn | Random Walk |

claim paper

Related Content

» Stationary distribution and cover time of random walks on random digraphs

» The distribution of the domination number of class cover catch digraphs for nonuniform one...

» The Diameter of Randomly Perturbed Digraphs and Some Applications

» Random Walks on Digraphs A Theoretical Framework for Estimating Transmission Costs in Wire...

» The cover time of the giant component of a random graph

» The cover time of sparse random graphs

» The cover time of random geometric graphs

» Tight Bounds for the Cover Time of Multiple Random Walks

» The cover time of the preferential attachment graph

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	APPROX
Authors	Colin Cooper, Alan M. Frieze

Comments (0)