Analysis of algorithms for listing equivalence classes of k-ary strings

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 1, 1998, Pages 94-109

  Proskurowski, Andrzej ^a   Ruskey, Frank ^b   Smith, Malcolm ^b  

^a UNIVERSITY OF OREGON   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Combinatorial generation; K ary strings; k paths; Restricted growth function; Stirling numbers

Indexed keywords

EID: 0346525423     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480192234009     Document Type: Article

References (20)

1. M. C. ER, A fast algorithm for generating set partitions, Comput. J., 31 (1988), pp. 283-284.
2. H. FREDRICKSEN AND I. J. KESSLER, An algorithm for generating necklaces of beads in two colors, Discrete Math., 61 (1986), pp. 181-188.
3. H. FREDRICKSEN AND I. J. MAIORANA, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math., 23 (1978), pp. 207-210.
4. R. L. GRAHAM, D. E. KNUTH, AND O. PATASHNIK, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
5. F. HARARY AND E. M. PALMER, On acyclic simplicial complexes, Mathematika, 15 (1968), pp. 115-122.
6. F. HERING, R. C. READ, AND G. C. SHEPHARD, The enumeration of stack polytopes and simplicial clusters, Discrete Math., 40 (1982), pp. 203-217.
7. G. HUTCHINSON, Partitioning algorithms for finite sets, Comm. ACM, 6 (1963), pp. 613-614.
8. R. A. KAYE, A Gray code for set partitions, Inform. Process. Lett., 5 (1976), pp. 171-173.
9. D. E. KNUTH, The Art of Computer Programming, Vol. I: Fundamental Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1973.
10. H. R. LEWIS AND L. DENENBERG, Data Structures & Their Algorithms, Harper-Collins, New York, 1991.
11. A. PROSKUROWSKI, Separating subgraphs in k-trees: Cables and caterpillars, Discrete Math., 49 (1984), pp. 275-285.
12. A. PROSKUROWSKI, F. RUSKEY, AND M. SMITH, Analysis of algorithms for generating k-paths, Tech. Report DCS-178, Univ. of Victoria, British Columbia, 1992.
13. D. J. ROSE, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970), pp. 597-609.
14. F. RUSKEY, C. D. SAVAGE, AND T. WANG, Generating necklaces, J. Algorithms, 13 (1992), pp. 414-430.
15. F. RUSKEY, Listing all bitstrings inequivalent under reversal, manuscript, 1990.
16. I. SEMBA, An efficient algorithm for generating all partitions of the set {1, 2,. . . , n}, J. Inform. Process., 7 (1984), pp. 41-42.
17. D. STANTON AND D. WHITE, Constructive Combinatorics, Springer-Verlag, Berlin, 1986.
18. H. S. WILF, Generating Functionology, Academic Press, New York, 1990.
19. S. G. WILLIAMSON, Combinatorics for Computer Science, Computer Science Press, Rockville, MD, 1985.
20. S. G. WILLIAMSON, Ranking algorithms for lists of partitions, SIAM J. Comput., 5 (1976), pp. 602-617.