Loopless Generation of Linear Extensions of a Poset

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.

[1]  Vincent Vajnovszki,et al.  On the Loopless Generation of Binary Tree Sequences , 1998, Inf. Process. Lett..

[2]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[3]  James F. Korsh,et al.  A Loopless Algorithm for Generation of Basic Minimal Interval Orders , 2000, Order.

[4]  James F. Korsh,et al.  Loopless Generation of Trees with Specified Degrees , 2002, Comput. J..

[5]  János Csirik,et al.  The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm , 1993, J. Algorithms.

[6]  E. Rodney Canfield,et al.  A loop-free algorithm for generating the linear extensions of a poset , 1995 .

[7]  Dominique Roelants van Baronaigien.  A Loopless Algorithm for Generating Binary Tree Sequences , 1991, Inf. Process. Lett..

[8]  James F. Korsh,et al.  Generating Multiset Permutations in Constant Time , 1997, J. Algorithms.

[9]  James F. Korsh.  Loopless Generation of k-Ary Tree Sequences , 1994, Inf. Process. Lett..

[10]  James F. Korsh,et al.  Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence , 2000, J. Algorithms.

[11]  Frank Ruskey,et al.  On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[12]  James F. Korsh,et al.  Shifts and Loopless Generation of k-Ary Trees , 1998, Inf. Process. Lett..

[13]  Gideon Ehrlich,et al.  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

[14]  Frank Ruskey,et al.  Generating Linear Extensions Fast , 1994, SIAM J. Comput..

[15]  Tadao Takaoka,et al.  An O(1) Time Algorithm for Generating Multiset Permutations , 1999, ISAAC.