## Nearest Common Ancestors: A survey and a new distributed algorithm (2002)

### Cached

### Download Links

- [www.math.tau.ac.il]
- [dept-info.labri.fr]
- [dept-info.labri.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 76 - 12 self |

### BibTeX

@INPROCEEDINGS{Alstrup02nearestcommon,

author = {Stephen Alstrup and Cyril Gavoille and Haim Kaplan and Theis Rauhe},

title = {Nearest Common Ancestors: A survey and a new distributed algorithm},

booktitle = {},

year = {2002},

pages = {258--264},

publisher = {ACM PRESS}

}

### Years of Citing Articles

### OpenURL

### Abstract

Several papers describe linear time algorithms to preprocess a tree, such that one can answer subsequent nearest common ancestor queries in constant time. Here, we survey these algorithms and related results. A common idea used by all the algorithms for the problem is that a solution for complete balanced binary trees is straightforward. Furthermore, for complete balanced binary trees we can easily solve the problem in a distributed way by labeling the nodes of the tree such that from the labels of two nodes alone one can compute the label of their nearest common ancestor. Whether it is possible to distribute the data structure into short labels associated with the nodes is important for several applications such as routing. Therefore, related labeling problems have received a lot of attention recently.