L. Legrand, A Further Improved LCA Algorithm, University of Minneapolis Technical Report Archive. TR90-01 (1990). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Linear Time Algorithm for Tree Mapping - Eulenstein (1996) (2 citations) (Correct)
....His method does not make efficient use of the structures TG and T S . Since M is essentially a least common ancestor (lca) our algorithm merges ideas similar to lca computation (see Harel and Tarjan [7] Schieber and Vishkin [8] and an improved version of this algorithm is outlined by Lisa Legrand [9]) The tree mapping problem can be reduced in linear time and space to the lca problem. Thus the asymptotic performance of these algorithms is the same as ours. However, our algorithm is less technical than these algorithms and therefore can be easily implemented. It is especially designed to ....
L. Legrand, A Further Improved LCA Algorithm, University of Minneapolis Technical Report Archive. TR90-01 (1990).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC