Scalable Motif-aware Graph Clustering
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

You comment anonymously! You will not be able to edit/delete the comment.

Please consider to register or login.

Use $\LaTeX$ to type formulæ and markdown to format text.
When you post something to which you hold the copyright you authorise us to do distribute this data across the scientific community. You can post public domain content. All user-generated content will be freely available online. Please see this page to learn more about Papersγ's terms of use and privacy policy.