A Simple Solution to the Level-Ancestor Problem

Menghani, Gaurav; Mátáni, Dhruv

doi:10.48550/arxiv.1903.01387

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several sequential and parallel algorithms are known for this problem [6,2,4,8,1,9]. This note describes a very simple O(1) query time algorithm for finding level ancestors.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simple O(1) Query Algorithm for Level Ancestors

Saxena¹

2022

Preprint

View full text Add to dashboard Cite

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.Earlier, Menghani and Matani described another simple algorithm; however, their algorithm takes O(log n) time to answer queries.Although the basic algorithm has preprocessing time of O(n log n), by having additional levels, the preprocessing time can be reduced to almost linear or linear.

show abstract

“…Several sequential and parallel algorithms are known for this problem [6,2,4,8,1,9]. This note describes a very simple O(1) query time algorithm for finding level ancestors.…”

Section: Introductionmentioning

confidence: 99%

“…Earlier, Menghani and Matani [9] described another simple algorithm. However, their algorithm takes O(log n) time to answer queries.…”

Section: Introductionmentioning

confidence: 99%