Nucleus decompositions have been shown to be a useful tool for finding d...
Differentially private algorithms allow large-scale data analytics while...
Obtaining scalable algorithms for hierarchical agglomerative clustering ...
This paper studies the nucleus decomposition problem, which has been sho...
This document describes an attempt to develop a compiler-based approach ...
Graph clustering and community detection are central problems in modern ...
We study the widely used hierarchical agglomerative clustering (HAC)
alg...
Maintaining a k-core decomposition quickly in a dynamic graph is an
impo...
Dense subgraphs capture strong communities in social networks and entiti...
Butterflies are the smallest non-trivial subgraph in bipartite graphs, a...