References
- Aho , A. V. and Ullman , J. D. 1995 . Foundation of Computer Science , New York : Computer Science Press .
- Avis , D. and Fukuda , K. 1996 . Reverse search for enumeration . Discrete Appl. Math. , 65 : 21 – 46 .
- Fenner , T. I. and Loizou , G. 1979 . A binary tree representation and related algorithms for generating integer partitions . Comp. J. , 23 : 332 – 337 .
- Kawano , S. and Nakano , S. 2005 . Constant time generation of set partition . IEICE Trans. Fundam. , E88-A ( 4 ) : 930 – 934 .
- Klingsberg , P. 1982 . A gray code for compositions . J. Algorithms , 3 : 41 – 44 .
- Nakano , S. and Uno , T. 2004 . Constant time generation of trees with specified diameter . Proc. of WG 2004, LNCS , 3353 : 33 – 45 .
- Nijenhuis , A. and Wilf , H. 1978 . Combinatorial Algorithms , New York : Academic Press .
- Rosen , K. H. 2000 . Discrete Mathematics and Its Applications , Singapore : WCB/McGraw-Hill .
- Savage , C. 1997 . A survey of combinatorial gray codes . SIAM Rev. , 39 : 605 – 629 .
- Tanenbaum , A. S. 2002 . Computer Networks , New Jersey : Prentice Hall, Upper Saddle River .
- Tanenbaum , A. S. 2004 . Modern Operating Systems , New Jersey : Prentice Hall, Upper Saddle River .
- Yamanaka , K. 2007 . Constant time generation of integer partitions . IEICE Trans. Fundam. , E-90-A ( 5 ) : 888 – 895 .
- Zoghbi , A. and Stojmenovic , I. 1998 . Fast algorithm for generating integer partitions . Intern. J. Comput. Math. , 70 : 319 – 332 .