Constant time generation of trees with specified diameter

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3353, Issue , 2004, Pages 33-45

  Nakano, Shin Ichi ^a   Uno, Takeaki ^b  

^a GUNMA UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; NUMBER OF TREES; SIMPLE ALGORITHM; SIMPLER ALGORITHMS;

TREES (MATHEMATICS);

FORESTRY; GRAPH THEORY;

EID: 35048861874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_3     Document Type: Article

References (15)

1. A.V. Aho and J.D. Ullman, Foundations of Computer Science, Computer Science Press, New York, (1995).
2. T. Beyer and S. M. Hedetniemi, Constant Time Generation of Rooted Trees, SIAM J. Comput., 9, (1980), pp. 706-712.
3. L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, New York, (1993).
4. J.T. Joichi, D.E. White and S.G. Williamson, Combinatorial Gray Codes, SIAM J. Comput., 9, (1980), pp. 130-141.
5. D.L. Kreher and D.R. Stinson, Combinatorial Algorithms, CRC Press, Boca Raton, (1998).
6. Z. Li and S. Nakano, Efficient Generation of Plane Triangulations without Repetitions, Proc. ICALP2001, LNCS 2076, (2001), pp. 433-443.
7. G. Li and F. Ruskey, The Advantage of Forward Thinking in Generating Rooted and Free Trees, Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, (1999), pp. 939-940.
8. B.D. McKay, Isomorph-free Exhaustive Generation, J. of Algorithms, 26, (1998), pp. 306-324.
9. S. Nakano, Efficient Generation of Plane Trees, Information Processing Letters, 84, (2002), pp. 167-172.
10. R.C. Read, How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations, Annals of Discrete Mathematics, 2, (1978), pp. 107-120.
11. K.H. Rosen (Eds.), Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, (2000).
12. C. Savage, A Survey of Combinatorial Gray Codes, SIAM Review, 39, (1997) pp. 605-629.
13. D.B. West, Introduction to Graph Theory, 2nd Ed, Prentice Hall, NJ, (2001).
14. H.S. Wilf, Combinatorial Algorithms: An Update, SIAM, (1989).
15. R.A. Wright, B. Richmond, A. Odlyzko and B.D. McKay, Constant Time Generation of Free Trees, SIAM J. Comput., 15, (1986), pp. 540-548.