The level ancestor problem simplified

Cites Work

A linear-time algorithm for a special case of disjoint set union
Finding level-ancestors in trees
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (63)

Distance queries over dynamic interval graphs
Absent Subsequences in Words
Balancing graph Voronoi diagrams with one more vertex
Linear-size suffix tries and linear-size CDAWGs simplified and improved
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees
Time efficient implementation for online \(k\)-server problem on trees
On longest common property preserved substring queries
On efficient algorithms for bottleneck path problems with many sources
Enumerating \(m\)-length walks in directed graphs with constant delay
Efficiently computing runs on a trie
Longest Lyndon Substring After Edit
Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
Succinct dynamic cardinal trees
Efficient Oracles and Routing Schemes for Replacement Paths
Shortest-Path Queries in Geometric Networks
Title not available (Why is that?)
Title not available (Why is that?)
Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
Fingerprints in compressed strings
Covering uncertain points in a tree
Connectivity Oracles for Graphs Subject to Vertex Failures
Absent subsequences in words
Mincut Sensitivity Data Structures for the Insertion of an Edge
Longest common extensions in trees
Efficient counting of square substrings in a tree
Cross-document pattern matching
Faster algorithms for computing the R* consensus tree
Title not available (Why is that?)
Ramsey partitions and proximity data structures
Position heaps for Cartesian-tree matching on strings and tries
Parallel construction of succinct trees
Internal dictionary matching
Computing longest palindromic substring after single-character or block-wise edits
Title not available (Why is that?)
Tight bound for the number of distinct palindromes in a tree
Small-space LCE data structure with constant-time queries
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Mincut sensitivity data structures for the insertion of an edge
Self-indexed Text Compression Using Straight-Line Programs
Fast layout computation of clustered networks: algorithmic advances and experimental analysis
Fully functional static and dynamic succinct trees
On compact representations of all-pairs-shortest-path-distance matrices
Constructing LZ78 tries and position heaps in linear time for large alphabets
Constant delay traversal of grammar-compressed graphs with bounded rank
Morphing tree drawings in a small 3D grid
Faster queries for longest substring palindrome after block edit
Top tree compression of tries
Tree path majority data structures
Fast Label Extraction in the CDAWG
Efficient computation of longest single-arm-gapped palindromes in a string
A linear‐time algorithm for broadcast domination in a tree
On finding the Adams consensus tree
Generalized substring compression
Range Medians
Computing runs on a trie
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
Simple and efficient fully-functional succinct trees
Compressed subsequence matching and packed tree coloring
Finding Articulation Points of Large Graphs in Linear Time
\(L_{1}\) shortest path queries in simple polygons
Longest Common Extensions in Trees
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning

   Recommendations

Title not available (Why is that?) 👍 👎
Finding level-ancestors in trees 👍 👎
The Level-Ancestor problem on pure pointer machines 👍 👎
Title not available (Why is that?) 👍 👎
A fast cost-optimal parallel algorithm for the lowest common ancestor problem 👍 👎

This page was built for publication: The level ancestor problem simplified

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