Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

DOI10.1006/jagm.2000.1079zbMath0951.68180OpenAlexW1995618045WikidataQ29036307 ScholiaQ29036307MaRDI QIDQ4485190

Mikkel Thorup, Stephen Alstrup

Publication date: 5 June 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1079

zbMATH Keywords

pointer machine algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (4)

Sequential and parallel algorithms for the NCA problem on pure pointer machines ⋮ Optimal pointer algorithms for finding nearest common ancestors in dynamic trees ⋮ Finding dominators via disjoint set union ⋮ The Level-Ancestor problem on pure pointer machines

This page was built for publication: Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees