Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction
CIKM, pp. 909-918, 2013.
maximal k-edge-connected subgraphsk-core componentefficient methodrandom contractionessential taskMore(10+)
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
Full Text (Upload PDF)
PPT (Upload PPT)