
Scalable Community Detection via Parallel Correlation Clustering
Graph clustering and community detection are central problems in modern ...
read it

Hierarchical Agglomerative Graph Clustering in NearlyLinear Time
We study the widely used hierarchical agglomerative clustering (HAC) alg...
read it

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using NearestNeighbor Chain
This paper studies the hierarchical clustering problem, where the goal i...
read it

Parallel BatchDynamic kCore Decomposition
Maintaining a kcore decomposition quickly in a dynamic graph is an impo...
read it

Parallel IndexBased Structural Graph Clustering and Its Approximation
SCAN (Structural Clustering Algorithm for Networks) is a wellstudied, w...
read it

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
We study fundamental graph problems such as graph connectivity, minimum ...
read it

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Connected components and spanning forest are fundamental graph algorithm...
read it

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Connected components is a fundamental kernel in graph applications due t...
read it

Parallel BatchDynamic kClique Counting
In this paper, we study new batchdynamic algorithms for kclique counti...
read it

Parallel Clique Counting and Peeling Algorithms
Dense subgraphs capture strong communities in social networks and entiti...
read it

Batchdynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees
Dynamic algorithms capable of supporting batches of updates are increasi...
read it

Optimizing Ordered Graph Algorithms with GraphIt
Many graph problems can be solved using ordered parallel graph algorithm...
read it

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms
Many graph problems can be solved using ordered parallel graph algorithm...
read it

SemiAsymmetric Parallel Graph Algorithms for NVRAMs
Emerging nonvolatile main memory (NVRAM) technologies provide novel fea...
read it

NearOptimal Massively Parallel Graph Connectivity
Identifying the connected components of a graph, apart from being a fund...
read it

Parallel BatchDynamic Graphs: Algorithms and Lower Bounds
In this paper we study the problem of dynamically maintaining graph prop...
read it

Massively Parallel Computation via Remote Memory Access
We introduce the Adaptive Massively Parallel Computation (AMPC) model, w...
read it

LowLatency Graph Streaming Using Compressed PurelyFunctional Trees
Due to the dynamic nature of realworld graphs, there has been a growing...
read it

Parallel BatchDynamic Graph Connectivity
With the rapid growth of graph datasets over the past decade, a new kind...
read it

BatchParallel Euler Tour Trees
The dynamic trees problem is to maintain a forest undergoing edge insert...
read it

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
There has been significant interest in parallel graph processing recentl...
read it
Laxman Dhulipala
is this you? claim profile