Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n+m)$ == Space Complexity == $O(n)$ words (https://www.cs.bgu.ac.il/~segal/PAPERS2/tarj.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://www.semanticscholar.org/paper/Fast-Algorithms-for-Finding-Nearest-Common-Harel-Tarjan/8867d059dda279b1aed4a0301e4e46f9daf65174") |
No edit summary |
||
| Line 7: | Line 7: | ||
$O(n)$ words | $O(n)$ words | ||
(https://www. | (https://www.semanticscholar.org/paper/Fast-Algorithms-for-Finding-Nearest-Common-Harel-Tarjan/8867d059dda279b1aed4a0301e4e46f9daf65174) | ||
== Description == | == Description == | ||
Latest revision as of 08:43, 10 April 2023
Time Complexity
$O(n+m)$
Space Complexity
$O(n)$ words
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984