Skip to main content

Regularity and optimality for trees

Contributed Papers

  • 555 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 884)

Abstract

A cost function for trees is introduced; roughly speaking the cost of a tree is the time needed to traverse all of its branches. A tree of least cost for a given number of leaves is called optimal. Bounds for the cost of an optimal tree are proved, and these bounds are used to restrict the possible outdegrees in optimal trees. Finally, a method for proving regularity in optimal trees is presented.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Eades and John Staples, “On Optimal Trees”, Technical Report No. 19, Dept. of Computer Science, University of Queensland (1980). (To appear).

    Google Scholar 

  2. F. Göbel and C. Hoede, “On an optimality property of ternary trees”, Inf. and Control 42, 10–26 (1979).

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Leslie M. Goldschlager and Peter Eades, “Cheapsort”, (to appear).

    Google Scholar 

  4. D. Knuth, The Art of Computer Programming, Vol. 3, “Sorting and Searching”, Addison-Wesley, Mass, 1973.

    MATH  Google Scholar 

  5. M. Schumberger and J. Vuillemin, Acta Informatica 3 (1973), 25–36.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Eades, P. (1981). Regularity and optimality for trees. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091816

Download citation

  • DOI: https://doi.org/10.1007/BFb0091816

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive