scientific article; zbMATH DE number 177536

MaRDI QIDQ4037405zbMATH OpenFDO

Authors Paul F. Dietz

Publication date 18 May 1993

zbMATH Keywords

ancestor queries on tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1670815
• Finding level-ancestors in trees
• scientific article; zbMATH DE number 4047158
• The Level-Ancestor problem on pure pointer machines
• scientific article; zbMATH DE number 2086252

Cited in

(19)

• Succinct representations of permutations and functions
• scientific article; zbMATH DE number 4047158 (Why is no real title available?)
• The level ancestor problem simplified
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Finding lowest common ancestors in arbitrarily directed trees
• Center location problems on tree graphs with subtree-shaped customers
• scientific article; zbMATH DE number 1670815 (Why is no real title available?)
• Longest common extensions in trees
• scientific article; zbMATH DE number 2086252 (Why is no real title available?)
• Longest common extensions in trees
• The Level-Ancestor problem on pure pointer machines
• Finding level-ancestors in trees
• Dynamic weighted ancestors
• Time efficient implementation for online \(k\)-server problem on trees
• The k-neighbor, r-domination problems on interval graphs
• Top tree compression of tries
• Computing longest (common) Lyndon subsequences
• Efficient algorithms for shortest distance queries on special classes of polygons
• Parent queries over dynamic balanced parenthesis strings

This page was built for publication:

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