Two problems on the generation of linear extensions of posets

Abstract

We describe two results on the generation of linear extensions of a poset. First, we prove that the linear extensions of every poset can be generated by insertion. Next, we describe a constant average time algorithm to generate the linear extensions of a series-parallel poset in lexicographic order .