15 citations · 17 across the 8 of their papers we have counts for
7 papers
Parallel -Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Maintaining a dynamic -core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents…
Kairos: Efficient Temporal Graph Analytics on a Single Machine
Joana M. F. da Trindade, Julian Shun, Samuel Madden +1
Many important societal problems are naturally modeled as algorithms over temporal graphs. To date, however, most graph processing systems remain inefficient as they rely on distri…
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala +1
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network ana…
Faster Parallel Exact Density Peaks Clustering
Yihao Huang, Shangdi Yu, Julian Shun
Clustering multidimensional points is a fundamental data mining task, with applications in many fields, such as astronomy, neuroscience, bioinformatics, and computer vision. The go…
Parallel Filtered Graphs for Hierarchical Clustering
Shangdi Yu, Julian Shun
Given all pairwise weights (distances) among a set of objects, filtered graphs provide a sparse representation by only keeping an important subset of weights. Such graphs can be pa…
Parallel Batch-Dynamic d-Trees
Rahul Yesantharao, Yiqiu Wang, Laxman Dhulipala +1
d-trees are widely used in parallel databases to support efficient neighborhood/similarity queries. Supporting parallel updates to d-trees is therefore an important operation…