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.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. London: MacMillan 1976
Floyd, R.W.: Algorithm 97: Shortest path. Communications ACM 5, 345 (1962)
Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 83–89 (1976)
Harary, F.: Graph theory. Reading, Massachusetts: Addison-Wesley 1969
Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks, Journal ACM 24, 1–13 (1977)
Pan, V.: Strassen's algorithm is not optimal. IEEE 19th Annual Symposium on Foundations of Computer Science pp. 166–176 (1978)
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354–356 (1969)
Vizing, V.G.: The number of edges in a graph of given radius, Sov. Math.-Dokl. 8, 535–536 (1967)
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
- Information System
- Operating System
- Data Structure
- Communication Network
- Information Theory