An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2 - Σπυράκης, Παύλος Γ.; Τσακαλίδης, Αθανάσιος (Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών, 1991)