An Improved Distribution Algorithm for Shortest Paths Problem
From MaRDI portal
Publication:3335005
Recommendations
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- A new upper bound on the complexity of the all pairs shortest path problem
- Improved algorithm for all pairs shortest paths
- Another adaptive distributed shortest path algorithm
- New Bounds on the Complexity of the Shortest Path Problem
Cited in
(8)- Improvements for the thresh X2 shortest path algorithm
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- scientific article; zbMATH DE number 5631939 (Why is no real title available?)
- A parallel algorithm for surface-based object reconstruction
- scientific article; zbMATH DE number 1670814 (Why is no real title available?)
- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages
- Optimized versions of a distributed algorithm for solving path problems
- Improved distributed algorithms for exact shortest paths
This page was built for publication: An Improved Distribution Algorithm for Shortest Paths Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335005)