Sciweavers

    RANDOM
    1999
    Springer
    91views Theoretical Computer Science» more  RANDOM 1999»
    A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
    13 years 9 months ago
    A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
    Download  www.cs.utexas.edu
    We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
    Seth Pettie, Vijaya Ramachandran
    claim paper
    Read More »
    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.