Finding lowest common ancestors in arbitrarily directed trees

Information Processing Letters

Volumn 50, Issue 6, 1994, Pages 307-310

  Nykänen, Matti ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Algorithms; Data structures; Lowest common ancestors

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

ARBITRARILY DIRECTED TREES; LINEAR TIME; LOWEST COMMON ANCESTORS;

ALGORITHMS;

EID: 0028446814     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(94)00050-6     Document Type: Article

References (5)

1. Efficient implementation of lattice operations
2. Fast algorithms for finding nearest common ancestors
3. On finding lowest common ancestors: Simplification and parallelization
4. An optimal pointer machine algorithm for finding nearest common ancestors