Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. ACM 20, 500–513 (1973)
2. Filliâtre, J.-C., Pottier, F.: Producing all ideals of a forest, functionally. Journal of Functional Programming 13(5), 945–956 (2003)
3. Koda, Y., Ruskey, R.: A Gray code for the ideals of a forest poset. Journal of Algorithms 15, 324–340 (1993)
4. Knuth, D.E.: SPIDERS: (2001),
http://www-cs-faculty.stanford.edu/~knuth/programs.html
5. Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicles 2,3,4. Addison-Wesley, Reading (2005)