Sciweavers

LATIN
2000
Springer

The LCA Problem Revisited

13 years 10 months ago
The LCA Problem Revisited
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable. Interestingly, this algorithm is a sequentialization of a previously known PRAM algorithm of Berkman, Breslauer, Galil, Schieber, and Vishkin [1].
Michael A. Bender, Martin Farach-Colton
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where LATIN
Authors Michael A. Bender, Martin Farach-Colton
Comments (0)