1980/07/01 by Norbert Blüm, Kurt Mehlhorn · 2 citations
Mathematics · Computer Science · #Graph theory and applications #Stochastic processes and statistical mechanics #Advanced Graph Theory Research
paper · doi:10.1016/0304-3975(80)90018-3
openalex publication_date 1980/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is shown that the average number of rebalancing operations (rotations and double rotations) in weight-balanced trees is constant.