Finding lowest common ancestors in arbitrarily directed trees

DOI10.1016/0020-0190(94)00050-6zbMath0810.68071OpenAlexW2012705570MaRDI QIDQ1330662

Matti Nykänen, Esko Ukkonen

Publication date: 4 April 1995

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00050-6

zbMATH Keywords

data structureslowest common ancestorarbitrarily directed trees

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Faster algorithms for finding lowest common ancestors in directed acyclic graphs ⋮ A Path Cover Technique for LCAs in Dags ⋮ The lowest common ancestor problem on a tree with an unfixed root ⋮ A \(\min\)-\(\max\) relation in flowgraphs and some applications

Cites Work

• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization

This page was built for publication: Finding lowest common ancestors in arbitrarily directed trees