Sciweavers

    SWAT
    1992
    Springer
    104views Algorithms» more  SWAT 1992»

    Low-Diameter Graph Decomposition is in NC

    14 years 3 months ago
    Low-Diameter Graph Decomposition is in NC
    Download  www.cs.tufts.edu
    We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.
    Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi
    claim paper
    Added 11 Aug 2010
    Updated 11 Aug 2010
    Type Conference
    Year 1992
    Where SWAT
    Authors Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    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.