Loopless generation of linear extensions of a poset

Order

Volumn 19, Issue 2, 2002, Pages 115-126

  Korsh, James F ^a   Lafollette, Paul S ^a  

^a Temple University   (United States)

Author keywords

Linear extension; Loopless algorithm; Poset; Topological sort

Indexed keywords

EID: 0141688476     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016548222238     Document Type: Article

References (16)

1. Bitner, J. R., Ehrlich, G. and Reingold, E. M. (1976) Efficient generation of the binary reflected gray code and its applications, Comm. ACM 19, 517-521.
2. Canfield, E. R. and Williamson, S. G. (1995) A loop-free algorithm for generating the linear extensions of a poset, Order 12, 57-75.
3. Ehrlich, G. (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial objects, J. ACM 20, 500-513.
4. Korsh, J. F. (1994) Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52, 243-247.
5. Korsh, J. F. and LaFollette, P. (2000) Multi-set permutations and loopless generation of ordered trees with specified degree sequence, J. Algorithms 34, 309-336.
6. Korsh, J. F. and LaFollette, P. (1999) Towers, beads, and loopless generation of trees with specified degree, Congressus Numerantium 139, 157-166.
7. Korsh, J. F. and Lipschutz, S. (1997) Generating multiset permutations in constant time, J. Algorithms 25, 321-335.
8. Korsh, J. F. and Lipschutz, S. (1998) Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65, 235-240.
9. LaFollette, P. S. and Korsh, J. F. (2000) A loopless algorithm for generation of basic minimal interval orders, Order 17, 271-285.
10. Lucas, J. M., Roelants van Baronaigien, D. and Ruskey, F. (1993) On rotations and the generation of binary trees, J. Algorithms 15, 1-24.
11. Pruesse, G. and Ruskey, F. (1994) Generating linear extensions fast, SIAM J. Comput. 23, 373-386.
12. Roelants van Baronaigien, D. (1991) A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39, 189-194.
13. Roelants van Baronaigien, D. (1997) Loopfree generation of k-ary trees, Technical Report DCS-25401R, Department of Computer Science, University of Victoria.
14. Takaoka, T. (1999) An o(1) time algorithm for generating multiset permutations, in ISAAC 99, LNCS 1741, pp. 237-246.
15. Vajnovszki, V. (1996) A loopless algorithm for generating k-ary reflected gray codes, Research Report Department IEM, University of Burgundy.
16. Vajnovszki, V. (1998) On the loopless generation of binary tree sequences, Inform. Process. Lett. 8, 113-117.