A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Fast Enumeration of Large k-Plexes
2017
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '17
k-plexes are a formal yet exible way of de ning communities in networks. ey generalize the notion of cliques and are more appropriate in most real cases: while a node of a clique C is connected to all other nodes of C, a node of a k-plex may miss up to k connections. Unfortunately, computing all maximal k-plexes is a gruesome task and state-of-the-art algorithms can only process small-size networks. In this paper we propose a new approach for enumerating large k-plexes in networks that speeds
doi:10.1145/3097983.3098031
dblp:conf/kdd/ConteFMPT17
fatcat:q6bjujltrjc77dv4mju2nule7e