Udaya Kumar Reddy K. R and K. Viswanathan Iyer
AllPairs ShortestPaths Problem for Unweighted Graphs in O(n2 log n) Time
320 - 326
2009
3
2
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/8870
https://publications.waset.org/vol/26
World Academy of Science, Engineering and Technology
Given a simple connected unweighted undirected graph G (V (G), E(G)) with V (G) n and E(G) m, we present a new algorithm for the allpairs shortestpath (APSP) problem. The running time of our algorithm is in O(n2 log n). This bound is an improvement over previous best known O(n2.376) time bound of Raimund Seidel (1995) for general graphs. The algorithm presented does not rely on fast matrix multiplication. Our algorithm with slight modifications, enables us to compute the APSP problem for unweighted directed graph in time O(n2 log n), improving a previous best known O(n2.575) time bound of Uri Zwick (2002).
Open Science Index 26, 2009