☆
Scalable Motif-aware Graph Clustering
Download
Authors: Charalampos E. Tsourakakis
Liked by: Maximimi, Open Reading Group
Domains: Graph mining
Tags: WWW2017
Uploaded by: Open Reading Group
Upload date: 2018-01-12 15:14:57

Comments:

### Can be extended to k-cliques and k-motifs: - To list k-cliques: https://github.com/maxdan94/kClist - To list k-motifs: https://github.com/maxdan94/kmotif ### Typos: - ", cf.[23]," - "conductance problem.Notice that" - "(CNM) [12] , Cfinder" - "Louvaine" instead of "Louvain" in Table 2
Reply
Open Reading Group at 2018-05-10 16:51:28

Please consider to register or login to comment on the paper.