Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Computing extremal and approximate distances in graphs having unit cost edges

  • 44 Accesses

  • 6 Citations


Using binary search and a Strassen-like matrix multiplication algorithm we obtain efficient algorithms for computing the diameter, the radius, and other distance-related quantities associated with undirected and directed graphs having unit cost (unweighted) edges. Similar methods are used to find approximate values for the distances between all pairs of vertices, and if the graph satisfies certain regularity conditions to find the exact distances.

This is a preview of subscription content, log in to check access.


  1. 1.

    Bondy, J.A., Murty, U.S.R.: Graph theory with applications. London: MacMillan 1976

  2. 2.

    Floyd, R.W.: Algorithm 97: Shortest path. Communications ACM 5, 345 (1962)

  3. 3.

    Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 83–89 (1976)

  4. 4.

    Harary, F.: Graph theory. Reading, Massachusetts: Addison-Wesley 1969

  5. 5.

    Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks, Journal ACM 24, 1–13 (1977)

  6. 6.

    Pan, V.: Strassen's algorithm is not optimal. IEEE 19th Annual Symposium on Foundations of Computer Science pp. 166–176 (1978)

  7. 7.

    Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354–356 (1969)

  8. 8.

    Vizing, V.G.: The number of edges in a graph of given radius, Sov. Math.-Dokl. 8, 535–536 (1967)

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Booth, K.S., Lipton, R.J. Computing extremal and approximate distances in graphs having unit cost edges. Acta Informatica 15, 319–328 (1981). https://doi.org/10.1007/BF00264532

Download citation


  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory