All Pairs Shortest Distances for Graphs with Small Integer Length Edges

@article{Galil1997AllPS,
  title={All Pairs Shortest Distances for Graphs with Small Integer Length Edges},
  author={Zvi Galil and Oded Margalit},
  journal={Inf. Comput.},
  year={1997},
  volume={134},
  pages={103-139}
}
There is a way to transform the All Pairs Shortest Distances (APSD) problem where the edge lengths are integers with small ( M) absolute value into a problem with edge lengths in [&1, 0, 1]. This transformation allows us to use the algorithms we developed earlier ([1]) and yields quite efficient algorithms. In this paper we give new improved algorithms for these problems. For n=|V| the number of vertices, M the bound on edge length, and | the exponent of matrix multiplication, we get the… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

55 Citations

05'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…