We present an ̃O(m+n^1.5)-time randomized algorithm for maximum cardinality bipartite
matching and related problems (eg transshipment, negative-weight shortest paths, and …

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 …

This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …

In the decremental single-source shortest paths problem, the goal is to maintain distances
from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In …

We present the first m polylog (n) work, polylog (n) time algorithm in the PRAM model that
computes (1+ є)-approximate single-source shortest paths on weighted, undirected graphs …

We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest
path problems including shortest-path-tree and transshipment. The universal optimality of …

This paper introduces stronger notions for approximate single-source shortest-path
distances and gives simple reductions to compute them from weaker standard notions of …

We provide Õ (∊–1)-pass semi-streaming algorithms for computing (1–∊)-approximate
maximum cardinality matchings in bipartite graphs. Our most efficient methods are …

We consider the problem of designing fundamental graph algorithms on the model of
Massive Parallel Computation (MPC). The input to the problem is an undirected graph G …

The single-source shortest-path (SSSP) problem is a notoriously hard problem in the
parallel context. In practice, the Δ-step** algorithm of Meyer and Sanders has been widely …