Skip to main content
Log in

Loopless Generation of Linear Extensions of a Poset

  • Published:
Order Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  3. Ehrlich, G. (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial objects, J. ACM 20, 500–513.

    Google Scholar 

  4. Korsh, J. F. (1994) Loopless generation of k-ary tree sequences, Inform. Process. Lett. 52, 243–247.

    Google Scholar 

  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.

    Google Scholar 

  6. Korsh, J. F. and LaFollette, P. (1999) Towers, beads, and loopless generation of trees with specified degree, Congressus Numerantium 139, 157–166.

    Google Scholar 

  7. Korsh, J. F. and Lipschutz, S. (1997) Generating multiset permutations in constant time, J. Algorithms 25, 321–335.

    Google Scholar 

  8. Korsh, J. F. and Lipschutz, S. (1998) Shifts and loopless generation of k-ary trees, Inform. Process. Lett. 65, 235–240.

    Google Scholar 

  9. LaFollette, P. S. and Korsh, J. F. (2000) A loopless algorithm for generation of basic minimal interval orders, Order 17, 271–285.

    Google Scholar 

  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.

    Google Scholar 

  11. Pruesse, G. and Ruskey, F. (1994) Generating linear extensions fast, SIAM J. Comput. 23, 373–386.

    Google Scholar 

  12. Roelants van Baronaigien, D. (1991) A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39, 189–194.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016548222238

Navigation