Efficient enumeration of ordered trees with k leaves

Theoretical Computer Science

Volumn 442, Issue , 2012, Pages 22-27

  Yamanaka, Katsuhisa ^a   Otachi, Yota ^b   Nakano, Shin Ichi ^c  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

^c GUNMA UNIVERSITY   (Japan)

Author keywords

Algorithm; Enumeration; Family tree; Graph; Ordered tree

Indexed keywords

BEST-KNOWN ALGORITHMS; ENUMERATION; FAMILY TREE; GRAPH; ORDERED TREE; SIMPLE ALGORITHM;

ALGORITHMS; FORESTRY;

TREES (MATHEMATICS);

ALGORITHMS; DIAGRAMS;

EID: 84861803382     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.01.017     Document Type: Conference Paper

References (29)

1. D. Avis, and K. Fukuda Reverse search for enumeration Discrete Appl. Math. 65 1-3 1996 21 46 (Pubitemid 126386259)
2. T. Beyer, and S. Hedetniemi Constant time generation of rooted trees SIAM J. Comput. 9 4 1980 706 712
3. T. Fenner, and G. Loizou A binary tree representation and related algorithms for generating integer partitions Comput. J. 23 4 1980 332 337
4. L. Goldberg Efficient Algorithms for Listing Combinatorial Structures 1993 Cambridge University Press New York
5. Y. Kikuchi, H. Tanaka, S. Nakano, and Y. Shibata How to obtain the complete list of caterpillars Proc. of COCOON LNCS vol. 2697 2003 329 338
6. D. Knuth Generating all Tuples and Permutations The Art of Computer Programming vol. 4 2005 Addison-Wesley (fascicle 2)
7. D. Knuth Generating all trees, History of Combinatorial Generation The Art of Computer Programming vol. 4 2006 Addison-Wesley (fascicle 4)
8. J. Korsh, and P. LaFollette Multiset permutations and loopless generation of ordered trees with specified degree sequence J. Algorithms 34 2 2000 309 336
9. J. Korsh, and P. LaFollette Loopless generation of trees with specified degrees Comput. J. 45 3 2002 364 372 (Pubitemid 34586449)
10. D. Kreher, and D. Stinson Combinatorial algorithms 1998 CRC Press Boca Raton
11. G. Li, F. Ruskey, The advantages of forward thinking in generating rooted and free trees, in: Proc. of SODA, 1999, pp. 939-940.
12. B. McKay Isomorph-free exhaustive generation J. Algorithms 26 2 1998 306 324 (Pubitemid 128638721)
13. T. Muramatsu, and S. Nakano A random generation of plane trees with exactly k leaves IEICE Trans. Fundamentals J90-A 12 2007 940 947 (in Japanese)
14. S. Nakano Efficient generation of plane trees Inform. Process. Lett. 84 3 2002 167 172 (Pubitemid 35018950)
15. S. Nakano Efficient generation of triconnected plane triangulations Comput. Geom. 27 2 2004 109 122
16. S. Nakano, and T. Uno Constant time generation of trees with specified diameter Proc. of WG LNCS vol. 3353 2004 33 45 (Pubitemid 39743780)
17. S. Nakano, and T. Uno Generating colored trees Proc. of WG LNCS vol. 3787 2005 249 260 (Pubitemid 43848618)
18. J. Pallo Generating trees with n nodes and m leaves Int. J. Comput. Math. 21 2 1987 133 144
19. R. Read Every one a winner or how to avoid isomorphism search Discrete Math. 2 1978 107 120
20. E. Reingold, J. Nievergelt, and N. Deo Combinatorial Algorithms 1977 Prentice Hall Englewood Cliffs, New Jersey
21. F. Ruskey, and D. van Baronaigien Fast recursive algorithms for generating combinatorial objects Congr. Numer. 41 1984 53 62
22. J. Sawada Generating rooted and free plane trees ACM Trans. Algorithms 2 1 2006 1 13 (Pubitemid 43925103)
23. R. Stanley Enumerative Combinatorics, vol. 2 1999 Cambridge University Press
24. H. Wilf Combinatorial algorithms: An Update 1989 SIAM
25. R. Wright, B. Richmond, A. Odlyzko, and B. McKay Constant time generation of free trees SIAM J. Comput. 15 2 1986 540 548 (Pubitemid 16546570)
26. K. Yamanaka, S. Kawano, Y. Kikuchi, and S. Nakano Constant time generation of integer partitions IEICE Trans. Fundamentals E90-A 5 2007 888 895
27. K. Yamanaka, and S. Nakano Listing all plane graphs J. Graph Algorithms Appl. 13 2009 5 18
28. S. Zaks, and D. Richards Generating trees and other combinatorial objects lexicographically SIAM J. Comput. 8 1 1979 73 81
29. A. Zoghbi, and I. Stojmenović Fast algorithms for generating integer partitions Int. J. Comput. Math. 70 1998 319 332 (Pubitemid 128610167)