| Display title | Tarjan's off-line lowest common ancestors algorithm |
| Default sort key | Tarjan's off-line lowest common ancestors algorithm |
| Page length (in bytes) | 5,756 |
| Namespace ID | 0 |
| Page ID | 243227 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 3 |
| Counted as a content page | Yes |
| Wikidata item ID | Q4919359 |
| Central description | algorithm for finding the lowest common ancestors of a set of pairs of nodes in a tree, using the union-find data structure |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Poor Yorick (talk | contribs) |
| Date of page creation | 05:33, 10 June 2003 |
| Latest editor | Rodion.Efremov (talk | contribs) |
| Date of latest edit | 08:21, 27 June 2025 |
| Total number of edits | 87 |
| Recent number of edits (within past 30 days) | 8 |
| Recent number of distinct authors | 1 |
| Hidden category (1) | This page is a member of 1 hidden category (help):
|
| Transcluded templates (23) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
