Cited in
(21)- Finding dominators via disjoint set union
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
- Strong articulation points and strong bridges in large scale graphs
- New common ancestor problems in trees and directed acyclic graphs
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- A linear-time algorithm for a special case of disjoint set union
- Parallel dynamic lowest common ancestors
- Ranking arborescences in O(Km log n) time
- A data structure for dynamic trees
- On computing distances between leaves in a complete tree
- Algorithms for weighted matching generalizations. II: f-factors and the special case of shortest paths
- Near-optimal algorithm for constructing greedy consensus tree
- On pattern matching with \(k\) mismatches and few don't cares
- Searching and encoding for infinite ordered sets
- Decomposition of triply rooted trees
- Complete edge-colored permutation graphs
- A Path Cover Technique for LCAs in Dags
- The nearest common ancestor in a dynamic tree
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- The longest common substring problem
This page was built for publication: On Finding Lowest Common Ancestors in Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4089769)
