Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
SODA
2003
ACM
favorite
Email
discuss
report
126
views
Algorithms
»
more
SODA 2003
»
The cover time of sparse random graphs
13 years 11 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision