Skip navigation
Skip navigation

Finding Maximal k-Edge-Connected Subgraphs from a Large Graph

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]

CollectionsANU Research Publications
Date published: 2012
Type: Conference paper
Source: ACM International Conference Proceeding Series
DOI: 10.1145/2247596.2247652


File Description SizeFormat Image
01_Zhou_Finding_Maximal_2012.pdf250.53 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator