Correctness of constructing optimal alphabetic trees revisited (Q1390875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A New Algorithm for Minimum Cost Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Proof of the T-C Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the Garsia-Wachs algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for optimal length-limited Huffman codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Alphabetic Tree Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the optimality of alphabetic trees / rank
 
Normal rank

Latest revision as of 12:12, 28 May 2024

scientific article
Language Label Description Also known as
English
Correctness of constructing optimal alphabetic trees revisited
scientific article

    Statements

    Correctness of constructing optimal alphabetic trees revisited (English)
    0 references
    0 references
    0 references
    0 references
    22 July 1998
    0 references
    optimal alphabetic trees
    0 references
    Garsia-Wachs algorithm
    0 references

    Identifiers