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 …

We give the first parallel algorithm with optimal $\tilde {O}(m) $ work for the classical problem
of computing Single-Source Shortest Paths in general graphs with negative-weight edges. In …

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 …

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 …

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 …

Conclusion In this paper, we propose the first fully dynamic parallel allpairs shortest path
algorithm in the MPC model with a worstcase update rounds of O (n 2 3− α 6 log n/α). We …

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 …