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

From Algorithm Wiki
Revision as of 10:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O (V^{2.{37}3} \log V)$ == Space Complexity == $O(V^{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?via%3Dihub")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(V^{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?via%3Dihub

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Seidel%27s_algorithm_(APSP_on_Dense_Undirected_Unweighted_Graphs;_APSP_on_Sparse_Undirected_Unweighted_Graphs_All-Pairs_Shortest_Paths_(APSP))&oldid=44622"