Parallel algorithms for solving aggregated shortest-path problems
From MaRDI portal
Recommendations
- Parallel Algorithms for Dynamic Shortest Path Problems
- A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
- scientific article; zbMATH DE number 56471
- A parallel shortest path algorithm
- Parallel asynchronous algorithms for the \(K\) shortest paths problem
Cited in
(13)- A parallel shortest augmenting path algorithm for the assignment problem
- Implementing parallel shortest path for parallel transportation applications
- Temporal shortest paths: Parallel computing implementations
- Accelerated parallel projection method for solving the shortest distance problem
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
- Computational Science – ICCS 2005
- Efficient parallel processing methods for road map queries
- A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
- Parallel Algorithms for Dynamic Shortest Path Problems
- A parallel shortest path algorithm
- scientific article; zbMATH DE number 6452892 (Why is no real title available?)
- scientific article; zbMATH DE number 735432 (Why is no real title available?)
- Parallel Algorithms for Network Routing Problems and Recurrences
This page was built for publication: Parallel algorithms for solving aggregated shortest-path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304488)
