Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction

    CIKM, pp. 909-918, 2013.

    Cited by: 28|Bibtex|Views1|Links
    EI
    Keywords:
    maximal k-edge-connected subgraphsk-core componentefficient methodrandom contractionessential taskMore(10+)

    Abstract:

    Capturing sets of closely related vertices from large networks is an essential task in many applications such as social network analysis, bioinformatics, and web link research. Decomposing a graph into k-core components is a standard and efficient method for this task, but obtained clusters might not be well-connected. The idea of using m...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments