The construction of optimal multiway search trees and the monotonicity principle

DOI10.1080/00207168108803225zbMATH Open0453.68030OpenAlexW1975500853MaRDI QIDQ3901002FDOQ3901002

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

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

Cited In (7)

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