PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering

Longlong Lin, Tao Jia, Zeli Wang +2

Higher-order graph clustering aims to partition the graph using frequently occurring subgraphs. Motif conductance is one of the most promising higher-order graph clustering models…