Recognizing breadth-first search trees in linear time
- 24 April 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (4) , 167-171
- https://doi.org/10.1016/0020-0190(90)90155-q
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984