Sciweavers

    EDBT
    2012
    ACM
    228views Database» more  EDBT 2012»
    Finding maximal k-edge-connected subgraphs from a large graph
    13 years 5 months ago
    Finding maximal k-edge-connected subgraphs from a large graph
    Download  www.edbt.org
    In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
    Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
    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.