Optimum multiway search trees

DOI10.1007/BF00288540zbMath0431.68065MaRDI QIDQ1138383

Derick Wood, Hans-Peter Kriegel, Vijay K. Vaishnavi

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal alphabetic search trees with restricted maximal height
• Nearly optimal binary search trees
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Optimum binary search trees
• 1-2 Brother Trees or AVL Trees Revisited
• The construction of optimal multiway search trees and the monotonicity principle
• Optimal Alphabetic Trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A New Algorithm for Minimum Cost Binary Trees
• Minimal-Comparison $2,3$-Trees
• Self-Organizing Binary Search Trees
• Dynamic Binary Search
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimal 2,3-Trees

This page was built for publication: Optimum multiway search trees