Skip to main content
Springer Nature Link
Log in

Computing extremal and approximate distances in graphs having unit cost edges

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

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 via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Kellogg S. Booth

  2. Department of Electrical Engineering and Computer Science, Princeton University, 08540, Princeton, New Jersey, USA

    Richard J. Lipton

Authors
  1. Kellogg S. Booth
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Richard J. Lipton
    View author publications

    You can also search for this author inPubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264532

Keywords