The lowest common ancestor problem on a tree with an unfixed root
From MaRDI portal
Publication:1961826
DOI10.1016/S0020-0255(99)00046-8zbMath0943.68037OpenAlexW1965896058MaRDI QIDQ1961826
Yuan-Cheng Chuang, Biing-Feng Wang, Jiunn-Nan Tsai
Publication date: 30 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00046-8
Cites Work
- New algorithms for the LCA problem and the binary tree reconstruction problem
- Finding lowest common ancestors in arbitrarily directed trees
- The nearest common ancestor in a dynamic tree
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
