## 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 binary trees is straightforward. Furthermore, for complete 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. Previous optimal algorithms for nearest common ancestor queries work using some mapping from a general tree to a complete binary tree. However, it is not clear how to distribute the data structures obtained using these mappings. We conclude our survey with a new simple algorithm that labels the nodes of a rooted tree such that from the labels of two nodes alone one can compute in constant time the label of their nearest common ancestor. The labels assigned by our algorithm are of size O(log n) bits where n is the number of nodes in the tree. The algorithm runs in O(n) time.

Original language | English |
---|---|

Pages | 258-264 |

Number of pages | 7 |

State | Published - 2002 |

Event | Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada Duration: 10 Aug 2002 → 13 Aug 2002 |

### Conference

Conference | Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures |
---|---|

Country/Territory | Canada |

City | Winnipeg, MAN. |

Period | 10/08/02 → 13/08/02 |