P330: Enumeration of all linear extensions of a given poset

P330: Enumeration of all linear extensions of a given poset

Input:

A poset $P$.

Output:

All linear extensions of $P$.

Complexity:

$O(1)$ time per solution.

Comment:

Their algorithm is a loop-free algorithm.

Reference:

[Canfield1995] (Bibtex)