✦ LIBER ✦

Maximal Flow in Branching Trees and Binary Search Trees

✍ Scribed by Federico Bassetti; Fabrizio Leisen

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 341 KB
Volume: 13
Category: Article
ISSN: 1387-5841
DOI: 10.1007/s11009-010-9164-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Patterns in random binary search trees

✍ Philippe Flajolet; Xavier Gourdon; Conrado Martínez 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit

Binary search trees in secondary memory

✍ William E. Wright 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 823 KB

Profiles of Random Trees: Limit Theorems

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

✍ Michael Fuchs; Hsien-Kuei Hwang; Ralph Neininger 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 469 KB

Improving time and space efficiency in g

Improving time and space efficiency in generalized binary search trees

✍ Cunto, Walter ;Gascon, Jose Luis 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 509 KB

Worst-case analysis for region and parti

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

✍ D. T. Lee; C. K. Wong 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 357 KB

On the costs of optimal and near-optimal

On the costs of optimal and near-optimal binary search trees

✍ Brian Allen 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 347 KB