We present a low-energy deterministic distributed algorithm that computes exact Single-
Source Shortest Paths (SSSP) in near-optimal time: it runs in Õ (n) rounds and each node is …

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 …

We give the first parallel algorithm with optimal Õ (m) work for the classical problem of
computing SingleSource Shortest Paths in general graphs with negative-weight edges. In …

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 …

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 …

A great earthquake usually causes heavy human casualties and extensive road damage.
Rational rescue routing is vital to save lives. Massive loose deposits and unstable slope …

We present several results on the round complexity of Replacement Paths and Second
Simple Shortest Path which are basic graph problems that can address fault tolerance in …

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

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 algorithms …

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