Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
From MaRDI portal
Publication:6499233
Cites work
- scientific article; zbMATH DE number 432845 (Why is no real title available?)
- scientific article; zbMATH DE number 1305103 (Why is no real title available?)
- scientific article; zbMATH DE number 512931 (Why is no real title available?)
- scientific article; zbMATH DE number 7650398 (Why is no real title available?)
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- A note on two problems in connexion with graphs
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Distributed algorithms for low stretch spanning trees
- Distributed verification and hardness of distributed approximation
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
- Efficient construction of directed hopsets and parallel approximate shortest paths
- Faster distributed shortest path approximations via shortcuts
- Faster parallel algorithm for approximate shortest path
- Faster shortest-path algorithms for planar graphs
- Heuristic shortest path algorithms for transportation applications: state of the art
- High-Probability Parallel Transitive-Closure Algorithms
- Highway dimension, shortest paths, and provably efficient algorithms
- Hopsets with constant hopbound, and applications to approximate shortest paths
- Introduction to local certification
- Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Nearly work-efficient parallel algorithm for digraph reachability
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Parallel approximate undirected shortest paths via low hop emulators
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Polylog-time and near-linear work approximation scheme for undirected shortest paths
- Single-Source Shortest Paths in the CONGEST Model with Improved Bound
- Spanners and emulators with sublinear distance errors
- The geometry of graphs and some of its algorithmic applications
- Thorup-Zwick emulators are universally optimal hopsets
- Universally-optimal distributed algorithms for known topologies
This page was built for publication: Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499233)
