Sciweavers

    OPODIS
    2007
    116views Distributed And Parallel Com...» more  OPODIS 2007»
    Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
    13 years 6 months ago
    Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
    Download  optimierung.mathematik.uni-kl.de
    Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
    Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
    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.