Sciweavers

    SODA
    2003
    ACM
    126views Algorithms» more  SODA 2003»

    The cover time of sparse random graphs

    14 years 1 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
    claim paper
    Added 01 Nov 2010
    Updated 01 Nov 2010
    Type Conference
    Year 2003
    Where SODA
    Authors Colin Cooper, Alan M. Frieze
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.