An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem

• Authors:

• Tadao Takaoka;Alistair Moffat

• Affiliations:

• -;-

• Venue:
• MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
• Year:
• 1980