Optimal Alphabetic Ternary Trees
classification
💻 cs.DS
keywords
algorithmalphabeticoptimalternarytreeschildrenclassiccomplexity
read the original abstract
We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.