Sciweavers

    COMPGEOM
    2009
    ACM
    134views Discrete Geometry» more  COMPGEOM 2009»
    Minimum cuts and shortest homologous cycles
    15 years 9 months ago
    Minimum cuts and shortest homologous cycles
    Download  compgeom.cs.uiuc.edu
    We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
    Erin W. Chambers, Jeff Erickson, Amir Nayyeri
    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.