Login / Signup
Best possible bounds for the weighted path length of optimum binary search trees.
Kurt Mehlhorn
Published in:
Automata Theory and Formal Languages (1975)
Keyphrases
</>
path length
binary search trees
shortest path
data structure
parallel algorithm
small world
upper bound
search tree
lower bound
b tree
clustering coefficient
data mining
social networks
search space
orders of magnitude