Improved algorithms for finding level ancestors in dynamic trees
From MaRDI portal
Recommendations
Cited in
(28)- The Level-Ancestor problem on pure pointer machines
- Finding level-ancestors in trees
- Dynamic path queries in linear space
- Top tree compression of tries
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- Position heaps for Cartesian-tree matching on strings and tries
- An improved algorithm for the minmax regret path center problem on trees
- Succinct indices for path minimum, with applications
- Incremental algorithm for maintaining a DFS tree for undirected graphs
- Dynamic weighted ancestors
- Longest common extensions in trees
- Maintaining information in fully dynamic trees with top trees
- On Dynamic DFS Tree in Directed Graphs
- Longest common extensions in trees
- Path Minima in Incremental Unrooted Trees
- Finding level-ancestors in dynamic trees
- scientific article; zbMATH DE number 1305412 (Why is no real title available?)
- Succinct representations of permutations and functions
- A space-optimal grammar compression
- Path minima queries in dynamic weighted trees
- The level ancestor problem simplified
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Time efficient implementation for online k-server problem on trees
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Compressed dictionary matching on run-length encoded strings
- Compressed dictionary matching on run-length encoded strings
This page was built for publication: Improved algorithms for finding level ancestors in dynamic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754135)
