Sciweavers

    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    14 years 4 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    claim paper
    Read More »
    ISAAC
    2004
    Springer
    115views Algorithms» more  ISAAC 2004»
    Multicriteria Global Minimum Cuts
    14 years 5 months ago
    Multicriteria Global Minimum Cuts
    Download  www.cs.tau.ac.il
    We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
    Amitai Armon, Uri Zwick
    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.