Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
V Ashvinkumar, A Bernstein, N Cao… - 32nd Annual …, 2024 - research-collection.ethz.ch
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 …
paths when edges can have negative integer weights (negative-weight SSSP). We show a …
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
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 …
of computing Single-Source Shortest Paths in general graphs with negative-weight edges. In …
Parallel and distributed exact single-source shortest paths with negative edge weights
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 …
when edges can have negative weights (negative-weight SSSP). We show a framework that …
A parallel priority queue with fast updates for GPU architectures
The single-source shortest path (SSSP) problem is a well-studied problem that is used in
many applications. In the parallel setting, a work-efficient algorithm that additionally attains …
many applications. In the parallel setting, a work-efficient algorithm that additionally attains …
Parallel Cache-Efficient Algorithms on GPUs
KM Berney - 2023 - search.proquest.com
Abstract Graphics Processing Units (GPUs) have emerged as a highly attractive architecture
for general-purpose computing due to their numerous programmable cores, low-latency …
for general-purpose computing due to their numerous programmable cores, low-latency …