research
∙
06/14/2023
Parallel Algorithms for Hierarchical Nucleus Decomposition
Nucleus decompositions have been shown to be a useful tool for finding d...
share
research
∙
11/20/2022
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
Differentially private algorithms allow large-scale data analytics while...
research
∙
06/23/2022
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Obtaining scalable algorithms for hierarchical agglomerative clustering ...
research
∙
11/22/2021
Theoretically and Practically Efficient Parallel Nucleus Decomposition
This paper studies the nucleus decomposition problem, which has been sho...
research
∙
10/01/2021
An Attempt to Generate Code for Symmetric Tensor Computations
This document describes an attempt to develop a compiler-based approach ...
research
∙
07/27/2021
Scalable Community Detection via Parallel Correlation Clustering
Graph clustering and community detection are central problems in modern ...
research
∙
06/10/2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
We study the widely used hierarchical agglomerative clustering (HAC) alg...
research
∙
06/07/2021
Parallel Batch-Dynamic k-Core Decomposition
Maintaining a k-core decomposition quickly in a dynamic graph is an impo...
research
∙
02/24/2020
Parallel Clique Counting and Peeling Algorithms
Dense subgraphs capture strong communities in social networks and entiti...
research
∙
07/19/2019
