Pages that link to "Item:Q5054814"
From MaRDI portal
The following pages link to Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814):
Displaying 7 items.
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Calculational derivation of pointer algorithms from tree operations (Q1283882) (← links)
- The nearest common ancestor in a dynamic tree (Q1821561) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Fast Algorithms for Finding Nearest Common Ancestors (Q3319776) (← links)
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
- A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)