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

For an n-vertex digraph G=(V, E), a shortcut set is a (small) subset of edges H taken from the
transitive closure of G that, when added to G guarantees that the diameter of G∪ H is small …

We obtain improved lower bounds for additive spanners, additive emulators, and diameter-
reducing shortcut sets. Spanners and emulators are sparse graphs that approximately …

Computing strongly connected components (SCC) is among the most fundamental problems
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …

This paper presents a randomized parallel single-source shortest paths (SSSP) algorithm for
directed graphs with non-negative integer edge weights that solves the problem exactly in O …

This brief announcement presents an algorithm for (1+ ε) approximate single-source shortest
paths for directed graphs with non-negative real edge weights in the CONGEST model that …

We prove several tight results on the fine-grained complexity of approximating the diameter
of a graph. First, we prove that, for any ε> 0, assuming the Strong Exponential Time …

While Dijkstra's algorithm has near-optimal time complexity for the problem of finding the
shortest $ st $-path, in practice, other algorithms are often superior on huge graphs. A …

Constructing efficient algorithms for graph problems is a fundamental problem in computer
science theory. This dissertation studies algorithms for large scale graphs and focuses on …

For an $ n $-vertex digraph $ G=(V, E) $, a\emph {shortcut set} is a (small) subset of edges $
H $ taken from the transitive closure of $ G $ that, when added to $ G $ guarantees that the …