Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Suppose a rooted tree T is given for preprocessing. The level-ancestor problem is to ansr quickly queries of the following form. Given a vertex v and an integer i > 0, find the ith vertex on the path from the root to v. Algorithms that achieve a linear time bound for preprocessing and a constant time bound for a query have been published by Dietz (1991), Alstrup and Holm (2000), and Bender and Farach (2002). The first two algorithms address dynamic versions of the problem; the last addresses the static version only and is the simplest. The purpose of this note is to expose another simple algorithm that lies under a complicated PRAM algorithm by Berkman and Vishkin (1990,1994).
['Amir M. Ben-Amram']
I am writing a research paper on a idea The Euler Path to Static Level-Ancestors
[{"from": "human", "value": "I am writing a research paper on a idea The Euler Path to Static Level-Ancestors"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Suppose a rooted tree T is given for preprocessing. The level-ancestor problem is to ansr quickly queries of the following form. Given a vertex v and an integer i > 0, find the ith vertex on the path from the root to v. Algorithms that achieve a linear time bound for preprocessing and a constant time bound for a query have been published by Dietz (1991), Alstrup and Holm (2000), and Bender and Farach (2002). The first two algorithms address dynamic versions of the problem; the last addresses the static version only and is the simplest. The purpose of this note is to expose another simple algorithm that lies under a complicated PRAM algorithm by Berkman and Vishkin (1990,1994)."}]