On O(1) time algorithms for combinatorial generation

Computer Journal

Volumn 44, Issue 4, 2001, Pages 292-302

  Xiang, Limin ^a   Ushijima, Kazuo ^b  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b Institute of Systems & Information Technologies/KYUSHU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; RECURSIVE FUNCTIONS; THEOREM PROVING;

CODING TREE; LOOPLESS ALGORITHM; STRONG MINIMAL CHANGE PROPERTY;

ALGORITHMS;

EID: 0035652918     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/44.4.292     Document Type: Article

References (33)

1. O(1) Time algorithms for combinatorial generation by tree traversal
2. Loopless algorithms for generating permutations, combinations, and other combinatorial configurations
3. Combination generation and Graylex ordering
4. A loopless algorithm for generating binary tree sequences
5. Loopless generation of k-ary tree sequences
6. Loopless generation of Gray codes for k-ary trees
7. Shifts and loopless generation of k-ary trees
8. On the loopless generation of binary tree sequences
9. Efficient loopless generation of Gray codes for k-ary Trees
10. On generating k-ary trees in computer representation
11. Generating t-ary trees in parallel
12. Enumeration of binary trees
13. Enumerating ordered trees lexicographically
14. Efficient generation of k-ary trees in natural order
15. A numbering system for binary trees
16. On rotations and the generation of binary trees
17. Enumerating, ranking and unranking binary trees
18. A note on generating binary trees in A-order and B-order
19. On the generation of binary trees
20. Generation of binary trees from ballot sequences
21. Generating t-ary trees lexicographically
22. A note on enumerating binary trees
23. Grammar-oriented enumeration of binary trees
24. Iterative formulas for enumerating binary trees
25. Grammar-oriented enumeration of arbitrary trees and arbitrary k-ary trees
26. Generating regular k-ary trees efficiently
27. Lexicographic generation of ordered trees
28. Generating binary trees using rotations
29. An algorithm for generating subsets of fixed size with a strong minimal change property
30. Efficient generation of binary reflected Gray code and its applications
31. The machine tools of combinatorics
32. Simple combinatorial Gray codes constructed by reversing sublists