Pages that link to "Item:Q596133"
From MaRDI portal
The following pages link to The level ancestor problem simplified (Q596133):
Displaying 14 items.
- Covering uncertain points in a tree (Q5920112) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Morphing tree drawings in a small 3D grid (Q6107028) (← links)
- Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)
- On longest common property preserved substring queries (Q6536252) (← links)
- On efficient algorithms for bottleneck path problems with many sources (Q6542462) (← links)
- Enumerating \(m\)-length walks in directed graphs with constant delay (Q6547915) (← links)
- Distance queries over dynamic interval graphs (Q6577442) (← links)
- Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)
- Time efficient implementation for online \(k\)-server problem on trees (Q6636094) (← links)
