Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1812:18, 15 February 2023‎ Admin talk contribs‎ 363 bytes +363‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Sleator_and_Tarjan_(Linking_and_Cutting)_(Lowest_Common_Ancestor_with_Linking_and_Cutting_Lowest_Common_Ancestor)"