Data Structures and Algorithms

    

Simpler O(1) Query Algorithm for Level Ancestors

Authors: Sanjeev Saxena

This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vishkin(O.Berkman and U.Vishkin, Finding level-ancestors in trees, JCSS, 48, 214--230, 1994).Although the basic algorithm has preprocessing time of O(n log n), by having additional levels or using table lookup, the preprocessing time can be reduced to almost linear or linear.The table lookup algorithm can be built in O(1) parallel time with n processors and can also be used to simplify the parallel algorithm of Berkman and Vishkin and make it optimal.

Comments: 10 Pages.

Download: PDF

Submission history

[v1] 2022-07-25 06:15:31
[v2] 2024-04-09 16:21:37
[v3] 2024-07-30 06:23:37

Unique-IP document downloads: 676 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus