Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …

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

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 …

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 …

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 …

Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in
a graph $ G=(V, E) $. This is a fundamental graph problem with classical sequential …

For an n-vertex directed graph G=(V, E), a β-shortcut set H is a set of additional edges H⊆
V× V such that GUH has the same transitive closure as G, and for every pair u, v∈ V, there is …

This paper presents parallel, distributed, and quantum algorithms for single-source shortest
paths when edges can have negative integer weights (negative-weight SSSP). We show a …

In this paper, we propose the problem of multi-constrained st simple paths enumeration on
temporal graph, which aims to list all temporal paths with the minimum timestamp in the …