Skip to main content
SpringerLink
Log in

Free cost measures of trees

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

Abstract

The paper presents a general approach to the computation of the expected value of various additive cost measures of a tree belonging to a simply generated family of trees. On the basis of these results, the behaviour of two refined cost measures is analyzed. This leads to surprising invariants which are valid for a tree in an arbitrary simply generated family of trees.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions, Dover Publications, New York, 1970.

    Google Scholar 

  2. Bender, E.A.: Asymptotic Methods in Enumeration, SIAM Rev. 16(4), 485–515, (1972).

    Google Scholar 

  3. Comtet, L.: Advanced Combinatorics, D.Reidel Publishing Company, Dordrecht-Holland/Boston U.S.A., 1974.

    Google Scholar 

  4. Flajolet, Ph., Odlyzko, A.: The Average Height of Binary Trees and Other Simple Trees, JCSS 25(2), 171–213, (1982).

    Google Scholar 

  5. Flajolet, Ph., Ottmann Th., Wood,D.: Search Trees and Bubble Memories, preprint (1983).

    Google Scholar 

  6. Kemp, R.: On A General Weight of Trees, Lecture Notes in Computer Science 166, (M. Fontet, K. Mehlhorn eds.), Springer-Verlag, Berlin/Heidelberg/New York/Tokyo, 109–120, 1984.

    Google Scholar 

  7. Kemp, R.: Additive Weights of Trees, preprint, University of Frankfurt, 1984 (submitted for publication).

    Google Scholar 

  8. Kemp, R.: Fundamentals of the Average Case Analysis of Particular Algorithms, Wiley & Teubner, Chichester, 1984.

    Google Scholar 

  9. Knuth, D.E.: The Art of Computer Programming, vol.1, 2nd ed., Addison Wesley, Reading, Mass., 1973.

    Google Scholar 

  10. Knuth, D.E.: The Art of Computer Programming, vol.3, Addison Wesley, Reading, Mass. 1973.

    Google Scholar 

  11. Meir, A., Moon, J.W.: On the Altitude of Nodes in Random Trees, Can. Math. 30, 997–1015, (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik (20), Johann Wolfgang Goethe-Universität, D-6000, Frankfurt a. M.

    R. Kemp

Authors
  1. R. Kemp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kemp, R. (1985). Free cost measures of trees. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028802

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation