Optimum multiway search trees

DOI10.1007/BF00288540MaRDI QIDQ1138383zbMATH OpenFDO

Authors D. Wood, Vijay K. Vaishnavi, Hans-Peter Kriegel

Publication date 1980

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

construction algorithmsoptimum multiway search trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3607502 (Why is no real title available?)
• 1-2 Brother Trees or AVL Trees Revisited
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A New Algorithm for Minimum Cost Binary Trees
• Dynamic Binary Search
• Minimal-Comparison $2,3$-Trees
• Nearly optimal binary search trees
• Optimal 2,3-Trees
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimal alphabetic search trees with restricted maximal height
• Optimum binary search trees
• Organization and maintenance of large ordered indexes
• Self-Organizing Binary Search Trees
• Symmetric binary B-trees: Data structure and maintenance algorithms
• The construction of optimal multiway search trees and the monotonicity principle

Cited in

(5)

• A new algorithm for the construction of optimal B-trees
• The construction of optimal multiway search trees and the monotonicity principle
• Optimal multiway search trees for variable size keys
• A counter example to a monotonicity property of k-d trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees

This page was built for publication: Optimum multiway search trees

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