Partial alphabetic trees

DOI10.1016/J.JALGOR.2005.06.001MaRDI QIDQ5468863zbMATH OpenOpenAlexFDO

Authors Arye Barkan, Haim Kaplan

Publication date 28 April 2006

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2005.06.001

zbMATH Keywords

Alphabetic codeAlphabetic treeHu-Tucker algorithmHuffman codesHuffman treePartial alphabetic tree

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 1947386
• Testing the optimality of alphabetic trees
• On the Huffman and alphabetic tree problem with general cost functions
• On the Huffman and alphabetic tree problem with general cost functions
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

Cited in

(7)

• Testing the optimality of alphabetic trees
• A new algorithm for building alphabetic minimax trees
• On the Huffman and alphabetic tree problem with general cost functions
• scientific article; zbMATH DE number 1947386 (Why is no real title available?)
• scientific article; zbMATH DE number 1543056 (Why is no real title available?)
• An approximation algorithm for binary searching in trees
• Old and new results on alphabetic codes

This page was built for publication: Partial alphabetic trees

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