Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+m*log(n)$) == 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 == 1983 == Reference == https://www.sciencedirect.com/science/article/pii/0022000083900065")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n+m*log(n)$)

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

1983

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Sleator_and_Tarjan_(Linking_and_Cutting)_(Lowest_Common_Ancestor_with_Linking_and_Cutting_Lowest_Common_Ancestor)&oldid=45666"