There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

Identifying the connected components of a graph, apart from being a fundamental problem
with countless applications, is a key primitive for many other algorithms. In this paper, we …

Minimum spanning tree (MST) is one of the most studied combinatorial problems with
practical applications in VLSI layout, wireless communication, and distributed networks …

In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a
fundamental problem that has received considerable attention in the sequential setting. The …

Graph connectivity is a fundamental problem in computer science with many important
applications. Sequentially, connectivity can be done in linear work easily using breadth-first …

Connected Components is a fundamental graph mining problem that has been studied for
the PRAM, MapReduce and BSP models. We present a simple CC algorithm for BSP that …

We present a randomized algorithm to find a minimum spanning forest (MSF) in an
undirected graph. With high probability, the algorithm runs in logarithmic time and linear …

This paper resolves a long-standing open problem on whether the concurrent write
capability of parallel random access machine (PRAM) is essential for solving fundamental …

The future of main memory appears to lie in the direction of new technologies that provide
strong capacity-to-performance ratios, but have write operations that are much more …

We consider the two-point query version of the fundamental geometric shortest path
problem: Given a set h of polygonal obstacles in the plane, having a total of n vertices, build …