Reproduce “KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.