Home › Entities › offline_algorithm › Tarjan's off-line least common ancestors algorithm

Tarjan's off-line least common ancestors algorithm

algorithm for finding the lowest common ancestors of a set of pairs of nodes in a tree, using the union-find data structure
Place offline_algorithm Q4919359
Press Enter · cited answer in seconds

Tarjan's off-line least common ancestors algorithm

Summary

Tarjan's off-line least common ancestors algorithm is an offline algorithm[1]. It draws 11 Wikipedia views per month (offline_algorithm category, ranking #1 of 1).[2]

Key Facts

  • Tarjan's off-line least common ancestors algorithm is credited with the discovery of Robert Tarjan[3].
  • Tarjan's off-line least common ancestors algorithm's instance of is recorded as offline algorithm[4].
  • Robert Tarjan is named after Tarjan's off-line least common ancestors algorithm[5].
  • Tarjan's off-line least common ancestors algorithm's time of discovery or invention is recorded as +1979-00-00T00:00:00Z[6].
  • Tarjan's off-line least common ancestors algorithm's Freebase ID is recorded as /m/01k8dj[7].
  • Tarjan's off-line least common ancestors algorithm's described by source is recorded as Applications of Path Compression on Balanced Trees[8].
  • Tarjan's off-line least common ancestors algorithm's computes solution to is recorded as lowest common ancestor[9].
  • Tarjan's off-line least common ancestors algorithm's uses is recorded as disjoint-set data structure[10].

Body

Designation and Status

Tarjan's off-line least common ancestors algorithm's instance of is recorded as offline algorithm[4].

History and Context

Robert Tarjan is named after Tarjan's off-line least common ancestors algorithm[5].

Why It Matters

Tarjan's off-line least common ancestors algorithm draws 11 Wikipedia views per month (offline_algorithm category, ranking #1 of 1).[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[11] It is known by 3 alternative names across languages and contexts.[12]

Related Entities

Robert Tarjan

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [4] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [5] ↑ . wikidata.org.
  4. [6] ↑ . wikidata.org.
  5. [7] ↑ . Freebase Data Dumps. wikidata.org.
  6. [8] ↑ . wikidata.org.
  7. [9] ↑ . wikidata.org.
  8. [10] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

Aggregate / graph-position facts

  1. [2] ↑ . Wikimedia Foundation. dumps.wikimedia.org.
  2. [11] ↑ . Wikidata sitelinks. wikidata.org.
  3. [12] ↑ . Wikidata aliases. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Tarjan's off-line least common ancestors algorithm. Retrieved May 3, 2026, from https://4ort.xyz/entity/tarjan-s-off-line-least-common-ancestors-algorithm
MLA “Tarjan's off-line least common ancestors algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/tarjan-s-off-line-least-common-ancestors-algorithm.
BibTeX @misc{4ortxyz_tarjan-s-off-line-least-common-ancestors-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Tarjan's off-line least common ancestors algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/tarjan-s-off-line-least-common-ancestors-algorithm}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Tarjan's off-line least common ancestors algorithm — https://4ort.xyz/entity/tarjan-s-off-line-least-common-ancestors-algorithm (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/tarjan-s-off-line-least-common-ancestors-algorithm · Last refreshed: