A data structure for dynamic trees
Daniel D. Sleator, Robert Endre Tarjan · Journal of Computer and System Sciences · 1983
Cited by 1,018 works. doi:10.1016/0022-0000(83)90006-5
Authors
References
- A Discipline of Programming
- Efficiency of a Good But Not Linear Set Union Algorithm
- Fast Algorithms for Finding Nearest Common Ancestors
- A dichromatic framework for balanced trees
- Applications of Path Compression on Balanced Trees
- Binary Search Trees of Bounded Balance
- Worst-case Analysis of Set Union Algorithms
- On Finding Lowest Common Ancestors in Trees
- Self-adjusting binary trees
- An 0 (nm log n) algorithm for maximum network flow