Efficiently Computing the Incorrect All-Pairs Shortest Path Matrix: Algorithms and Hardness

The paper proposes efficient algorithms for computing the incorrect all-pairs shortest path matrix obtained by a variant of the Floyd-Warshall algorithm, and proves that this incorrect variant is APSP-complete.