A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this work we examine the problem of finding large, diverse communities on graphs where the users are separated into distinct groups. More specifically, this work considers diversity to be the inclusion of users from multiple groups as opposed to homogeneous communities in which the majority of users are from one group. We design and propose the k * -Partite Clique (and the edge-maximum k * -Partite Clique Problem) which modifies the k-Partite Clique structure as a means to capture thesedblp:journals/pvldb/ZhouW020 fatcat:pops4otyorcfhige4gdf6pu3ou