Seidel's algorithm (APSP on Dense Undirected Unweighted Graphs; APSP on Sparse Undirected Unweighted Graphs All-Pairs Shortest Paths (APSP))

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O (n^{2.{37}3} \log n)$

Space Complexity

$O(n^{2})$ words

(Derived: Uses four auxiliary $V \times V$ matrices)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1995

Reference

https://www.sciencedirect.com/science/article/pii/S0022000085710781