| All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time (2006) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract 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 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||