All pairs shortest distances for graphs with small integer length edges

DOI10.1006/inco.1997.2620zbMath0879.68081OpenAlexW1969668378MaRDI QIDQ1363778

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

zbMATH Keywords

all pairs shortest distances

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

A new approach to all-pairs shortest paths on real-weighted graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths ⋮ All pairs shortest paths for graphs with small integer length edges ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ Improved algorithm for all pairs shortest paths ⋮ An \(O(n^3 \log \log n / \log^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 ⋮ On dynamic shortest paths problems ⋮ Unnamed Item ⋮ An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ Combinatorial algorithms for distributed graph coloring ⋮ An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: All pairs shortest distances for graphs with small integer length edges