The construction of optimal multiway search trees and the monotonicity principle
From MaRDI portal
Publication:3901002
DOI10.1080/00207168108803225zbMath0453.68030OpenAlexW1975500853MaRDI QIDQ3901002
Publication date: 1981
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168108803225
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Operations research applications of dichotomous search ⋮ Optimum multiway search trees ⋮ On the construction of weighted time-optimal B-trees ⋮ A counter example to a monotonicity property of k-d trees ⋮ Optimal multiway search trees for variable size keys ⋮ Generalized binary split trees ⋮ Optimum extensions of prefix codes.
Cites Work
This page was built for publication: The construction of optimal multiway search trees and the monotonicity principle
