Description: A k-plex is a graph-theoretic generalization of a clique in which each vertex is adjacent to all but at most a specified number of others.
2018 · Matthias Bentert, Anne-Sophie Himmel, et al. · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · 24