A Randomized Parallel Algorithm for Single-Source Shortest Paths
From MaRDI portal
Publication:4372999
Recommendations
Cited in
(27)- scientific article; zbMATH DE number 6708314 (Why is no real title available?)
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- scientific article; zbMATH DE number 1863286 (Why is no real title available?)
- Computational Science – ICCS 2005
- Hopsets with constant hopbound, and applications to approximate shortest paths
- Thorup-Zwick emulators are universally optimal hopsets
- scientific article; zbMATH DE number 6452892 (Why is no real title available?)
- scientific article; zbMATH DE number 4016203 (Why is no real title available?)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Undirected single-source shortest paths with positive integer weights in linear time
- scientific article; zbMATH DE number 7266346 (Why is no real title available?)
- A hierarchy of lower bounds for sublinear additive spanners
- scientific article; zbMATH DE number 2080918 (Why is no real title available?)
- scientific article; zbMATH DE number 2208627 (Why is no real title available?)
- scientific article; zbMATH DE number 7561636 (Why is no real title available?)
- Finding real-valued single-source shortest paths in \(o(n^3)\) expected time
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (extended abstract)
- Δ-stepping: a parallelizable shortest path algorithm
- Nearly work-efficient parallel algorithm for digraph reachability
- Single-source shortest paths in the CONGEST model with improved bounds
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Distributed planar reachability in nearly optimal time
- Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
- Improved processor bounds for parallel algorithms for weighted directed graphs
- A mechanism design approach for multi-party machine learning
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
- A simple parallel algorithm for the single-source shortest path problem on planar digraphs
This page was built for publication: A Randomized Parallel Algorithm for Single-Source Shortest Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372999)
