论文信息 - Computing extremal and approximate distances in graphs having unit cost edges

Computing extremal and approximate distances in graphs having unit cost edges

SummaryUsing 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.

Richard J. Lipton | Kellogg S. Booth

[1] Uppaluri S. R. Murty,et al. Graph Theory with Applications , 1978 .

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[4] V. Strassen. Gaussian elimination is not optimal , 1969 .

[5] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[6] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[7] Frank Harary,et al. Graph Theory , 2016 .

[8] Victor Y. Pan,et al. Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).