Fast Maximum $k$-Plex Algorithms Parameterized by Small Degeneracy Gaps

1 code implementation • 23 Jun 2023 • Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao, Jin-Kao Hao

We define a novel parameter of the input instance, $g_k(G)$, the gap between the degeneracy bound and the size of the maximum $k$-plex in the given graph, and present an exact algorithm parameterized by this $g_k(G)$, which has a worst-case running time polynomial in the size of the input graph and exponential in $g_k(G)$.

Community Detection Graph Mining