scientific article

zbMath0765.68025MaRDI QIDQ4037405

Paul F. Dietz

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ancestor queries on tree

Mathematics Subject Classification ID

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

Related Items (13)

Longest common extensions in trees ⋮ The \(k\)-neighbor, \(r\)-domination problems on interval graphs ⋮ Fingerprints in compressed strings ⋮ The level ancestor problem simplified ⋮ Computing longest (common) Lyndon subsequences ⋮ Longest Common Extensions in Trees ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Succinct representations of permutations and functions ⋮ Efficient algorithms for shortest distance queries on special classes of polygons ⋮ Compressed subsequence matching and packed tree coloring ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ The Level-Ancestor problem on pure pointer machines ⋮ Top tree compression of tries

This page was built for publication: