All pairs shortest distances for graphs with small integer length edges
From MaRDI portal
Publication:1363778
DOI10.1006/INCO.1997.2620zbMATH Open0879.68081OpenAlexW1969668378MaRDI QIDQ1363778FDOQ1363778
Authors: Zvi Galil, Olded Margalit 
Publication date: 12 January 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2620
Recommendations
Cited In (18)
- Combinatorial algorithms for distributed graph coloring
- A survey of the all-pairs shortest paths problem and its variants in graphs
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
- Improved algorithm for all pairs shortest paths
- A note on reachability and distance oracles for transmission graphs
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- All pairs shortest paths for graphs with small integer length edges
- Shortest distances as enumeration problem
- A new approach to all-pairs shortest paths on real-weighted graphs
- Some results on approximate 1-median selection in metric spaces
- On dynamic shortest paths problems
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
- Using weighted graphs features for fast searching their parameters
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- On computing the diameter of real-world undirected graphs
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)
