Listing Maximal k-Plexes in Large Real-World Graphs

by   Zhengren Wang, et al.

Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely investigated. However, in practice, communities rarely form as cliques for various reasons, e.g., data noise. Therefore, k-plex, – graph with each vertex adjacent to all but at most k vertices, is introduced as a relaxed version of clique. Often, to better simulate cohesive communities, an emphasis is placed on connected k-plexes with small k. In this paper, we continue the research line of listing all maximal k-plexes and maximal k-plexes of prescribed size. Our first contribution is algorithm ListPlex that lists all maximal k-plexes in O^*(γ^D) time for each constant k, where γ is a value related to k but strictly smaller than 2, and D is the degeneracy of the graph that is far less than the vertex number n in real-word graphs. Compared to the trivial bound of 2^n, the improvement is significant, and our bound is better than all previously known results. In practice, we further use several techniques to accelerate listing k-plexes of a given size, such as structural-based prune rules, cache-efficient data structures, and parallel techniques. All these together result in a very practical algorithm. Empirical results show that our approach outperforms the state-of-the-art solutions by up to orders of magnitude.


page 1

page 2

page 3

page 4


Scaling Up Maximal k-plex Enumeration

Finding all maximal k-plexes on networks is a fundamental research probl...

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices

In this paper, we address the independent set enumeration problem. Altho...

Clique percolation method: memory efficient almost exact communities

Automatic detection of relevant groups of nodes in large real-world grap...

Listing All Maximal k-Plexes in Temporal Graphs

Social networks evolve over time, that is, new contacts appear and old c...

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive

The Bron-Kerbosch algorithm is a well known maximal clique enumeration a...

Efficiently Finding a Maximal Clique Summary via Effective Sampling

Maximal clique enumeration (MCE) is a fundamental problem in graph theor...

Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments

Finding (maximum-cardinality) "cliquish" subgraphs is a central topic in...

Please sign up or login with your details

Forgot password? Click here to reset