Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Tarjan's off-line least common ancestors algorithm · Vinony

🌐English

English Italiano Polski فارسی ไทย 日本語

EntityQ4919359· pop 7· linked from 5 articles

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

Available in 7 languages

Italiano
Polski
Serbian
Ukrainian
فارسی
ไทย

Connections

disjoint-set data structure

computer science

Categories

Graph algorithms

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

International Standard Book Number

Entity

digital object identifier

time complexity

Tarjan's strongly connected components algorithm

lowest common ancestor

Journal of the ACM

Sign in to save

What links here5 pages

lowest common ancestor

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Tarjan's strongly connected components algorithm

Entitydist 0.49

descendant chart

Entitydist 0.53

Scipio–Paullus–Gracchus family tree

Entitydist 0.54

Kernighan–Lin algorithm

Entitydist 0.55

Module:family tree/style.css

Entitydist 0.57

De Bruijn graph

Entitydist 0.60

Entitydist 0.60

Bareiss algorithm

Entitydist 0.61

Template:Brutus family tree

Entitydist 0.61

genetics and archaeogenetics of South Asia

Entitydist 0.61

population genomics

Entitydist 0.61

Cuthill–McKee algorithm

Entitydist 0.62