Lowest common ancestor problem on a tree with an unfixed root

Information sciences

Volumn 119, Issue 1-2, 1999, Pages 125-130

  Wang, Biing Feng ^a   Tsai, Jiunn Nan ^a   Chuang, Yuan Cheng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

LOWEST COMMON ANCESTOR; UNFIXED ROOT;

ALGORITHMS;

EID: 0033207273     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00046-8     Document Type: Article

References (5)

1. Harel D., Tarjan R.E. Fast algorithm for finding nearest common ancestors. SIAM Journal on Computing. 13(2):1984;338-355.
2. Nykanen M., Ukkonen E. Finding lowest common ancestors in arbitrarily directed trees. Information Processing Letters. 50:1994;307-310.
3. Schieber B., Vishkin U. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing. 17(6):1988;1253-1262.
4. Tsakalidis A.K. The nearest common ancestor in a dynamic tree. Acta Informatica. 25(1):1988;37-54.
5. Wen Z. New algorithms for the LCA problem and the binary tree reconstruction problem. Information Processing Letters. 51:1994;11-16.