Listing Maximal k-Plexes in Large Real-World Graphs

1 code implementation • 17 Feb 2022 • Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov

Our first contribution is algorithm ListPlex that lists all maximal $k$-plexes in $O^*(\gamma^D)$ time for each constant $k$, where $\gamma$ 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.

Community Detection