Sciweavers

    OPODIS
    2007
    116views Distributed And Parallel Com...» more  OPODIS 2007»
    Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
    15 years 4 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
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.