Zhou, Rui; liu, Chengfei; Yu, Jeffrey; Liang, Weifa; Chen, Baichen; Li, Jianxin
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 finding such vertex clusters is interesting in many applications, e. g., social network analysis, bioinformatics, web link research. Compared with other explicit structures for modeling vertex clusters, such as quasi-clique, k-core, which only set the requirement on vertex degrees, k-edge-connected subgraph further requires...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.