The construction of optimal multiway search trees and the monotonicity principle

DOI10.1080/00207168108803225MaRDI QIDQ3901002zbMATH OpenOpenAlexFDO

Authors L. R. Gotlieb, D. Wood

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

zbMATH Keywords

algorithmsdynamic programming

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Cites work

• Optimal Alphabetic Trees
• Optimum binary search trees
• Optimum multiway search trees

Cited in

(7)

• Optimal multiway search trees for variable size keys
• A counter example to a monotonicity property of k-d trees
• Optimum extensions of prefix codes.
• On the construction of weighted time-optimal B-trees
• Optimum multiway search trees
• Operations research applications of dichotomous search
• Generalized binary split trees

This page was built for publication: The construction of optimal multiway search trees and the monotonicity principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901002)