activity
20232025
most citedQuery-Centered Temporal Community Search via Time-Constrained Personalized PageRank

1 citations · 1 across the 7 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

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…