All pairs shortest distances for graphs with small integer length edges
From MaRDI portal
Publication:1363778
Recommendations
Cited in
(18)- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Shortest distances as enumeration problem
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- Some results on approximate 1-median selection in metric spaces
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
- Combinatorial algorithms for distributed graph coloring
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
- On computing the diameter of real-world undirected graphs
- All pairs shortest paths for graphs with small integer length edges
- A survey of the all-pairs shortest paths problem and its variants in graphs
- A note on reachability and distance oracles for transmission graphs
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
- A new approach to all-pairs shortest paths on real-weighted graphs
- Improved algorithm for all pairs shortest paths
- Using weighted graphs features for fast searching their parameters
- On dynamic shortest paths problems
This page was built for publication: All pairs shortest distances for graphs with small integer length edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363778)
