ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    BIT 17 (1977), S. 1-15 
    ISSN: 1572-9125
    Keywords: Optimal α-β binary trees ; balances of binary trees ; total weighted path lengths ; variable-length codes ; data set allocation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we consider a special kind of binary trees where each right edge is associated with a positive numberα and each left edge with a positive numberβ(α ≦ β). Givenα, β and the number of nodesn, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for givenα, β, n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...