10 citations · 31 across the 12 of their papers we have counts for
4 papers · 1 filter
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
Shangdi Yu, Jessica Shi, Jamison Meindl +7
We introduce the ParClusterers Benchmark Suite (PCBS) -- a collection of highly scalable parallel graph clustering algorithms and benchmarking tools that streamline comparing diffe…
Parallel Algorithms for Hierarchical Nucleus Decomposition
Jessica Shi, Laxman Dhulipala, Julian Shun
Nucleus decompositions have been shown to be a useful tool for finding dense subgraphs. The coreness value of a clique represents its density based on the number of other cliques i…
Theoretically and Practically Efficient Parallel Nucleus Decomposition
Jessica Shi, Laxman Dhulipala, Julian Shun
This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is effi…
Parallel Algorithms for Butterfly Computations
Jessica Shi, Julian Shun
Butterflies are the smallest non-trivial subgraph in bipartite graphs, and therefore having efficient computations for analyzing them is crucial to improving the quality of certain…