Skip to main content
SpringerLink
Log in

Tree Enumeration

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

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

Recommended Reading

  1. Avis D, Fukuda K (1996) Reverse search for enumeration. Discret Appl Math 65(1–3):21–46

    Article  MATH  MathSciNet  Google Scholar 

  2. Beyer T, Hedetniemi SM (1980) Constant time generation of rooted Trees. SIAM J Comput 9(4):706–712

    Article  MATH  MathSciNet  Google Scholar 

  3. Knuth DE (2006) Generating all trees. The art of computer programming, vol 4, Fascicle4. Addison-Wesley, Upper Saddle River

    Google Scholar 

  4. Nakano S (2002) Efficient generation of plane trees. Inf Process Lett 84:167–172

    Article  MATH  Google Scholar 

  5. Nakano S, Uno T (2004) Constant time generation of trees with specified diameter. In: Proceedings the 30th workshop on graph-theoretic concepts in computer science (WG 2004), Bad Honnef, LNCS, vol 3353, pp 33–45

    Google Scholar 

  6. Rosen KH(Ed) (1999) Handbook of discrete and combinatorial mathematics. CRC, Boca Raton

    Google Scholar 

  7. Yamanaka K, Otachi Y, Nakano S (2012) Efficient enumeration of ordered trees with k leaves. Theor Comput Sci 442:2–27

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, Kiryu, Japan

    Shin-ichi Nakano

Authors
  1. Shin-ichi Nakano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shin-ichi Nakano .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Nakano, Si. (2015). Tree Enumeration. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_726-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_726-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation