Finding maximal k-edge-connected subgraphs from a large graph

R. Zhou, C. Liu, J.X. X. Yu, W. Liang, B. Chen, Jianxin Li

Research output: Chapter in Book/Conference paperConference paper

24 Citations (Scopus)

Abstract

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 high connectivity within a subgraph (a stronger requirement), and hence defines a more closely related vertex cluster. To find maximal k-edge-connected subgraphs from a graph, a basic approach is to repeatedly apply minimum cut algorithm to the connected components of the input graph until all connected components are k-connected. However, the basic approach is very expensive if the input graph is large. To tackle the problem, we propose three major techniques: vertex reduction, edge reduction and cut pruning. These speed-up techniques are applied on top of the basic approach. We conduct extensive experiments and show that the speed-up techniques are very effective. © 2012 ACM.
Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2012
Subtitle of host publication15th International Conference on Extending Database Technology, Proceedings
Place of PublicationUSA
PublisherElsevier
Pages480-491
Number of pages12
ISBN (Print)9781450307901
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event15th International Conference on Extending Database Technology - Berlin, Germany
Duration: 27 Mar 201230 Mar 2012

Conference

Conference15th International Conference on Extending Database Technology
CountryGermany
CityBerlin
Period27/03/1230/03/12

Fingerprint Dive into the research topics of 'Finding maximal k-edge-connected subgraphs from a large graph'. Together they form a unique fingerprint.

  • Cite this

    Zhou, R., Liu, C., Yu, J. X. X., Liang, W., Chen, B., & Li, J. (2012). Finding maximal k-edge-connected subgraphs from a large graph. In Advances in Database Technology - EDBT 2012: 15th International Conference on Extending Database Technology, Proceedings (pp. 480-491). Elsevier. https://doi.org/10.1145/2247596.2247652