All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: time

Timothy M. Chan. All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: time. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 514-523, ACM Press, 2006. [doi]

Abstract

Abstract is missing.