scientific article; zbMATH DE number 177536

zbMATH Open0765.68025MaRDI QIDQ4037405FDOQ4037405

Authors: Paul F. Dietz 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

ancestor queries on tree

Mathematics Subject Classification ID

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

Cited In (19)

• Title not available (Why is that?)
• Succinct representations of permutations and functions
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Fingerprints in compressed strings
• The level ancestor problem simplified
• Finding lowest common ancestors in arbitrarily directed trees
• Title not available (Why is that?)
• Center location problems on tree graphs with subtree-shaped customers
• Title not available (Why is that?)
• Longest common extensions in trees
• The Level-Ancestor problem on pure pointer machines
• Finding level-ancestors in trees
• 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
• Compressed subsequence matching and packed tree coloring
• Longest Common Extensions in Trees
• Efficient algorithms for shortest distance queries on special classes of polygons

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)