Constant time generation of set partitions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 4, 2005, Pages 930-934

  Kawano, Shin Ichiro ^a   Nakano, Shin Ichi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Algorithm; Enumeration; Gray code; The bell number; The stirling number of the second kind

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; NUMBER THEORY;

BELL NUMBER; ENUMERATION; GRAY CODE; STIRLING NUMBER OF THE SECOND KIND;

SET THEORY;

EID: 24144481568     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: 10.1093/ietfec/e88-a.4.930     Document Type: Conference Paper

References (16)

1. T. Beyer and S.M. Hedetniemi, "Constant time generation of rooted trees," SIAM J. Comput., vol.9, pp.706-712, 1980.
2. L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, New York, 1993.
3. R. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, 1994.
4. J.T. Joichi, D.E. White, and S.G. Williamson, "Combinatorial Gray codes," SIAM J. Comput., vol.9, pp. 130-141, 1980.
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, pp.433-443, 2001.
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, pp.939-940, 1999.
8. B.D. McKay, "Isomorph-free exhaustive generation," J. Algorithms, vol.26, pp.306-324, 1998.
9. S. Nakano, "Efficient generation of plane trees," Inf. Process. Lett., vol.84, pp.167-172, 2002.
10. S. Nakano and T. Uno, "A simple constant time enumeration algorithm for free trees," IPSJ Technical Report, 2003-AL-91-2, 2003.
11. R.C. Read, "How to avoid isomorphism search when cataloguing combinatorial configurations," Annals of Discrete Mathematics, vol.2, pp.107-120, 1978.
12. F. Ruskey, "Simple combinatorial Gray codes constructed by reversing sublists," Proc. ISAAC93, LNCS 762, pp.201-208, 1993.
13. K.H. Rosen, ed., Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, 2000.
14. C. Savage, "A survey of combinatorial Gray codes," SIAM Review, vol.39, pp.605-629, 1997.
15. H.S. Wilf, Combinatorial Algorithms: An Update, SIAM, 1989.
16. R.A. Wright, B. Richmond, A. Odlyzko, and B.D. McKay, "Constant time generation of free trees," SIAM J. Comput., vol.15, pp.540-548, 1986.