Now showing items 1-1 of 1
An O(n 3 log log n/ log2 n) Time Algorithm for All Pairs Shortest Paths
(University of Canterbury, 2002)
Given an input directed graph G = (V, E), the all pairs shortest path problem (APSP) is to compute the shortest paths between all pairs of vertices of G assuming that edge costs are real values. The APSP problem is a ...