Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances

Cites Work

A note on two problems in connexion with graphs
The geometry of graphs and some of its algorithmic applications
Approximate distance oracles
Efficient Algorithms for Shortest Paths in Sparse Networks
Approximate distance oracles with constant query time
Distributed verification and hardness of distributed approximation
Heuristic shortest path algorithms for transportation applications: state of the art
Highway dimension, shortest paths, and provably efficient algorithms
Faster shortest-path algorithms for planar graphs
Planar graphs, negative weight edges, shortest paths, and near linear time
Title not available (Why is that?)
High-Probability Parallel Transitive-Closure Algorithms
A Randomized Parallel Algorithm for Single-Source Shortest Paths
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Title not available (Why is that?)
Universally-optimal distributed algorithms for known topologies
Efficient construction of directed hopsets and parallel approximate shortest paths
Thorup-Zwick emulators are universally optimal hopsets
Spanners and emulators with sublinear distance errors
Hopsets with constant hopbound, and applications to approximate shortest paths
An efficient parallel algorithm for shortest paths in planar layered digraphs
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
Faster parallel algorithm for approximate shortest path
Parallel approximate undirected shortest paths via low hop emulators
Single-Source Shortest Paths in the CONGEST Model with Improved Bound
Introduction to local certification
Distributed algorithms for low stretch spanning trees
Title not available (Why is that?)
Faster distributed shortest path approximations via shortcuts
Title not available (Why is that?)
Nearly work-efficient parallel algorithm for digraph reachability

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)