We revisit the all-pairs-shortest-paths problem for an unweighted undirected graph with n vertices and m edges. We present new algorithms with the following running times: O(mn = log n) if m? n log
No takes yet. Share an insight, caveat, or question.
Timothy M. Chan (2006) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: