All pairs shortest distances for graphs with small integer length edges
From MaRDI portal
(Redirected from Publication:1363778)
Recommendations
Cited in
(20)- All pairs shortest paths for graphs with small integer length edges
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- A new approach to all-pairs shortest paths on real-weighted graphs
- Combinatorial algorithms for distributed graph coloring
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
- Improved algorithm for all pairs shortest paths
- A survey of the all-pairs shortest paths problem and its variants in graphs
- An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths
- On computing the diameter of real-world undirected graphs
- Some results on approximate 1-median selection in metric spaces
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Using weighted graphs features for fast searching their parameters
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- A note on reachability and distance oracles for transmission graphs
- Shortest distances as enumeration problem
- On dynamic shortest paths problems
- Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths
- Removing the log factor from (,+)-products on bounded range integer matrices
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
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)
