Off-Line Lowest Common Ancestor: Revision history

28 April 2023

• curprev 09:0809:08, 28 April 2023‎ Admin talk contribs‎ 1,783 bytes −288‎ No edit summary

15 February 2023

• curprev 14:4514:45, 15 February 2023‎ Admin talk contribs‎ 2,071 bytes −13‎ No edit summary
• curprev 14:3714:37, 15 February 2023‎ Admin talk contribs‎ 2,084 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 2,086 bytes +14‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 2,072 bytes −10‎ No edit summary

• curprev 10:2210:22, 15 February 2023‎ Admin talk contribs‎ 2,082 bytes +2,082‎ Created page with "{{DISPLAYTITLE:Off-Line Lowest Common Ancestor (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, the collection of trees is static and the entire sequence of queries is specified in advance. == Related Problems == Generalizations: Lowest Common Ancestor Related: Lowest Common Ancestor with Static Trees, ..."