28 citations · 88 across the 42 of their papers we have counts for
7 papers · 1 filter
Parallel Index-Based Structural Graph Clustering and Its Approximation
Tom Tseng, Laxman Dhulipala, Julian Shun
SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely used graph clustering algorithm. For large graphs, however, sequential SCAN variants are prohibitively…
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we…
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Changwan Hong, Laxman Dhulipala, Julian Shun
Connected components and spanning forest are fundamental graph algorithms due to their use in many important applications, such as graph clustering and image segmentation. GPUs are…
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Laxman Dhulipala, Changwan Hong, Julian Shun
Connected components is a fundamental kernel in graph applications. The fastest existing parallel multicore algorithms for connectivity are based on some form of edge sampling and/…
Parallel Batch-Dynamic -Clique Counting
Laxman Dhulipala, Quanquan C. Liu, Julian Shun +1
In this paper, we study new batch-dynamic algorithms for the -clique counting problem, which are dynamic algorithms where the updates are batches of edge insertions and deletion…
Parallel Clique Counting and Peeling Algorithms
Jessica Shi, Laxman Dhulipala, Julian Shun
We present a new parallel algorithm for -clique counting/listing that has polylogarithmic span (parallel time) and is work-efficient (matches the work of the best sequential alg…