Abstract
Canfield and Williamson gave the first loopless algorithm for generating all linear extensions of a poset. It elegantly generates all signed extensions, resulting in each extension appearing somewhere with each sign, but retains only every other one independent of its sign. It uses an array for the extension. In this paper we give another loopless algorithm for generating all the linear extensions. It generates each extension only once and uses a list for the extensions.
Similar content being viewed by others
References
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.
Canfield, E. R. and Williamson, S. G. (1995) A loop-free algorithm for generating the linear extensions of a poset, Order 12, 57–75.
Ehrlich, G. (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial objects, J. ACM 20, 500–513.
Korsh, J. F. (1994) Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52, 243–247.
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.
Korsh, J. F. and LaFollette, P. (1999) Towers, beads, and loopless generation of trees with specified degree, Congressus Numerantium 139, 157–166.
Korsh, J. F. and Lipschutz, S. (1997) Generating multiset permutations in constant time, J. Algorithms 25, 321–335.
Korsh, J. F. and Lipschutz, S. (1998) Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65, 235–240.
LaFollette, P. S. and Korsh, J. F. (2000) A loopless algorithm for generation of basic minimal interval orders, Order 17, 271–285.
Lucas, J. M., Roelants van Baronaigien, D. and Ruskey, F. (1993) On rotations and the generation of binary trees, J. Algorithms 15, 1–24.
Pruesse, G. and Ruskey, F. (1994) Generating linear extensions fast, SIAM J. Comput. 23, 373–386.
Roelants van Baronaigien, D. (1991) A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39, 189–194.
Roelants van Baronaigien, D. (1997) Loopfree generation of k-ary trees, Technical Report DCS-25401R, Department of Computer Science, University of Victoria.
Takaoka, T. (1999) An o(1) time algorithm for generating multiset permutations, in ISAAC 99, LNCS 1741, pp. 237-246.
Vajnovszki, V. (1996) A loopless algorithm for generating k-ary reflected gray codes, Research Report Department IEM, University of Burgundy.
Vajnovszki, V. (1998) On the loopless generation of binary tree sequences, Inform. Process. Lett. 8, 113–117.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Korsh, J.F., LaFollette, P.S. Loopless Generation of Linear Extensions of a Poset. Order 19, 115–126 (2002). https://doi.org/10.1023/A:1016548222238
Issue Date:
DOI: https://doi.org/10.1023/A:1016548222238