Sciweavers

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

79

Voted

SODA
2003
ACM

favoriteEmaildiscussreport

126views Algorithms» more SODA 2003»

The cover time of sparse random graphs

14 years 11 months ago

The cover time of sparse random graphs

Download www.dcs.kcl.ac.uk

We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n

Colin Cooper, Alan M. Frieze

Real-time Traffic

Algorithms | Cover Time | SODA 2003 |

claim paper

Related Content

» Solving Sparse Random Instances of Max Cut and Max 2CSP in Linear Expected Time

» Note on Sparse Random Graphs and Cover Graphs

» Covering minimum spanning trees of random subgraphs

» The cover time of the preferential attachment graph

» NearLinear Time Construction of Sparse Neighborhood Covers

» Tight Bounds for the Cover Time of Multiple Random Walks

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

» The cover time of random geometric graphs

» Expander Properties and the Cover Time of Random Intersection Graphs

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Colin Cooper, Alan M. Frieze

Comments (0)