Dense subgraphs capture strong communities in social networks and entities possessing strong interactions in biological networks. In particular, k-clique counting and listing have applications in identifying important actors in a graph. However, finding k-cliques is computationally expensive, and thus it is important to have fast parallel algorithms.
<coherence> Dense subgraphs capture strong communities in social networks and entities possessing strong interactions in biological networks. In particular, k-clique counting and listing have applications in identifying important actors in a graph. However, finding k-cliques is computationally expensive, and thus it is important to have fast parallel algorithms.