An Optimal Algorithm for Finding NCA on Pure Pointer Machines

DOI10.1007/3-540-45471-3_44MaRDI QIDQ3046520zbMATH OpenOpenAlexFDO

Authors A. Dal Palú, Enrico Pontelli, Desh Ranjan

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_44

Mathematics Subject Classification ID

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

Recommendations

• Sequential and parallel algorithms for the NCA problem on pure pointer machines
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
• Near-optimal labeling schemes for nearest common ancestors
• scientific article; zbMATH DE number 4047158

Cited in

(3)

• Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
• Sequential and parallel algorithms for the NCA problem on pure pointer machines

This page was built for publication: An Optimal Algorithm for Finding NCA on Pure Pointer Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046520)