![]() |
Volumn 13, Issue 2, 1984, Pages 338-355
|
FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS.
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTER PROGRAMMING - ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
GRAPH ALGORITHM;
NEAREST COMMON ANCESTOR;
RANDOM ACCESS MACHINE;
MATHEMATICAL TECHNIQUES;
|
EID: 0021426157
PISSN: 00975397
EISSN: None
Source Type: Journal
DOI: 10.1137/0213024 Document Type: Article |
Times cited : (973)
|
References (14)
|